𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A genetic algorithm for vehicle routing with backhauling

✍ Scribed by Jean-Yves Potvin; Christophe Duhamel; François Guertin

Publisher
Springer US
Year
1996
Tongue
English
Weight
930 KB
Volume
6
Category
Article
ISSN
0924-669X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a greedy route construction heuristic for a vehicle routing problem with backhauling is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of customers. Then, a genetic algorithm is used to identify an ordering that produces good routes. Numerical comparisons are provided with an exact algorithm and with other heuristic approaches.

📜 SIMILAR VOLUMES

Stochastic vehicle routing with modified
Stochastic vehicle routing with modified savings algorithm
✍ Moshe Dror; Pierre Trudeau 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 690 KB

A stochastic vehicle routing problem (SVRP) differs from the well known vehicle routing problem (VRP) in that the actual customer demand is not known with certainty when the vehicle routes are designed.One aspect that differentiates between these problems is the notion of route failure. Route failur

Reducing costs of backhaul networks for
Reducing costs of backhaul networks for PCS networks using genetic algorithms
✍ Louis Anthony Cox; Lawrence Davis; Leonard L. Lu; David Orvosh; Xiaorong Sun; De 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 997 KB

Designing cost-effective telecommunications networks often involves solving several challenging, interdependent combinatorial optimization problems simultaneously. For example, it may be necessary to select a least-cost subset of locations (network nodes) to serve as hubs where traffic is to be aggr