A heuristic for the routing and carrier selection problem

European Journal of Operational Research

Volumn 183, Issue 2, 2007, Pages 926-932

  Bolduc, Marie Claude ^a   Renaud, Jacques ^a   Boctor, Fayez ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

External transportation carriers; Heterogeneous limited fleet; Vehicle routing

Indexed keywords

HEURISTIC METHODS; OPERATIONS RESEARCH; PROBLEM SOLVING;

EXTERNAL TRANSPORTATION CARRIERS; HETEROGENEOUS LIMITED FLEET;

VEHICLE ROUTING;

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

References (8)

1. Ball M.O., Golden A., Assad A., and Bodin L.D. Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences 14 (1983) 103-120
2. Chu C.-W. A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research 165 (2005) 657-667
3. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568-581
4. Diaby M., and Ramesh R. The distribution problem with carrier service: a dual based penalty approach. ORSA Journal on Computing 7 (1995) 24-35
5. Klincewicz J.G., Luss H., and Pilcher M.G. Fleet size planning when outside carrier service are available. Transportation Science 24 (1990) 169-182
6. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
7. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421-451
8. Renaud J., Boctor F.F., and Laporte G. A fast composite heuristic for the symmetric traveling salesman problem. ORSA Journal on Computing 8 (1996) 134-143