A heuristic algorithm for the truckload and less-than-truckload problem

European Journal of Operational Research

Volumn 165, Issue 3, 2005, Pages 657-667

  Chu, Ching Wu ^a  

^a NATIONAL TAIWAN OCEAN UNIVERSITY   (Taiwan)

Author keywords

0 1 integer programming; Heuristics; Logistics; Vehicle routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FREIGHT TRANSPORTATION; FUNCTIONS; INTEGER PROGRAMMING; PROBLEM SOLVING; WAREHOUSES;

0-1 INTEGER PROGRAMMING; TRUCKLOAD PROBLEM; VEHICLE ROUTING;

HEURISTIC METHODS;

EID: 13444251412     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.08.067     Document Type: Article

References (21)

1. Schneider L.M. New era in transportation strategy. Transportation Strategy. 1985;118-126
2. Laporte G., Gendreau M., Potvin J.-Y., Semet F. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research. 7:2000;285-300
3. Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivery points. Operational Research. 12:1964;568-581
4. Gaskell T.J. Basis for vehicle fleet scheduling. Operational Research Quarterly. 18:1967;281
5. Yellow P. A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly. 21:1970;281
6. Lin S. Computer solution of the traveling salesman problem. Bell System Technology Journal. 44:1965;2245-2269
7. Lin S., Kernighan B. An effective heuristic algorithm for the traveling salesman problem. Operational Research. 21:1973;498-516
8. Christofides N., Eilon S. An algorithm for the vehicle dispatching problems. Operational Research Quarterly. 20:1969;309-318
9. Gillett B., Miller L. A heuristic algorithm for the vehicle dispatch problem. Operational Research. 22:1974;340-349
10. Christofides N., Mingozzi A., Toth P. The Vehicle Routing Problem, Combinatorial Optimization. 1979;Wiley, Chichester. pp. 315-338
11. Osman I.H. Metastrategy simulated annealing and tabu search algorithm for the vehicle routing problem. Annals of Operations Research. 41:1993;421-451
12. Taillard É.D. Parallel iterative search methods for vehicle routing problem. Networks. 23:1993;661-673
13. Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Science. 40:1994;1276-1290
14. Rochat Y., Taillard É.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167
15. Xu J., Kelly J.P. A network flow-based tabu search heuristic for the vehicle routing problem. Transportation Science. 30:1996;379-393
16. Rego C., Roucairol C. A parallel tabu search algorithm using ejection chains for vehicle routing problem. Osman I.H., Kelly J.P. Meta-Heuristics: Theory and Applications. 1996;Kluwer, Boston
17. Ball M.O., Golden A., Assad A., Bodin L.D. Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences. 14:1983;103-120
18. Y.K. Agarwal, Vehicle routing with limited fleet and common carrier option, presented at TIMS/ORSA Joint National Meeting, Boston, 1985
19. Klincewicz J.G., Luss H., Pilcher M.G. Fleet size planning when outside carrier service are available. Transportation Science. 24:1990;169-182
20. Toth P., Vigo D. A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. European Journal of Operational Research. 113:1999;528-543
21. Kindervater G.A.P., Savelsbergh M.W.P. Vehicle routing: Handling edge exchanges. Aarts E.H., Lenstra J.K. Local Search in Combinatorial Optimization. 1997;Wiley, Chichester