Development of mathematical models for the container road transportation in Korean trucking industries

Computers and Industrial Engineering

Volumn 53, Issue 2, 2007, Pages 252-262

  Chung, Ki Ho ^a   Ko, Chang Seong ^a   Shin, Jae Young ^b   Hwang, Hark ^c   Kim, Kap Hwan ^d  

^a Kyungsung University   (South Korea)

^b Korea Maritime University   (South Korea)

^c Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^d Pusan National University   (South Korea)

Author keywords

Container transportation; Heuristic algorithm; Mathematical model; TSP; VRP

Indexed keywords

HEURISTIC ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; TRANSFER CASES (VEHICLES); TRAVELING SALESMAN PROBLEM; VEHICLE ROUTING;

CONTAINER ROAD TRANSPORTATION; CONTAINER TRANSPORTATION; VEHICLE ROUTING PROBLEM;

TRUCK TRANSPORTATION;

EID: 34548236862     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2007.06.017     Document Type: Article

References (7)

1. Bodin L.D., Golden B.L., Assad A.A., and Ball M.O. Routing and scheduling of vehicles and crews: The state of the art. Computers and Operations Research 10 2 (1983) 63-211
2. Cullen F.H., Jarvis J.J., and Ratliff H.D. Set partitioning based heuristics for interactive routing. Networks 11 (1981) 125-143
3. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 (1991) 7-22
4. Psaraftis H.N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14 (1980) 130-154
5. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17 (1983) 351-357
6. Rosenkrantz D., Sterns R., and Lewis P. An analysis of several heuristics for the traveling salesman problem SIAM. Journal of Computing 6 (1977) 563-581
7. Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 (1995) 17-29