Scheduling of Intelligent and Autonomous Vehicles under pairing/unpairing collaboration strategy in container terminals

Transportation Research Part C: Emerging Technologies

Volumn 33, Issue , 2013, Pages 1-21

  Gelareh, Shahin ^a,b,c,d   Merzouki, Rochdi ^b,d   McGinley, Kay ^e   Murray, Roisin ^e  

^a Technoparc Futura   (France)

^b ECOLE CENTRALE DE LILLE   (France)

^c UNIV LILLE   (France)

^d Polytech Lille   (France)

^e DUBLIN INSTITUTE OF TECHNOLOGY   (Ireland)

Author keywords

Automated guided vehicle; Discrete event simulation; Intelligent Autonomous Vehicle; Lagrangian relaxation; Mixed integer programming; Scheduling

Indexed keywords

AUTOMATIC GUIDED VEHICLES; CONTAINERS; CRANES; DISCRETE EVENT SIMULATION; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; MANEUVERABILITY; MOBILE ROBOTS; PORT TERMINALS; SCHEDULING;

AUTOMATED GUIDED VEHICLES; DECOMPOSITION APPROACH; HIGH-QUALITY SOLUTIONS; INTELLIGENT AUTONOMOUS VEHICLES; INTELLIGENT TRANSPORTATION; LAGRANGIAN RELAXATION; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING MODEL;

AUTONOMOUS VEHICLES;

COMPUTER SIMULATION; CONTAINER TERMINAL; DEVELOPMENT PROJECT; EUROPEAN UNION; INTELLIGENT TRANSPORTATION SYSTEM; LAGRANGIAN ANALYSIS; PORT OPERATION;

COUNTY DUBLIN; IRELAND; LEINSTER;

GRUIDAE;

EID: 84878120439     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2013.04.006     Document Type: Article

References (28)

1. Bahiense L., Maculan N., Sagastizábal C.A. The volume algorithm revisited: relation with bundle methods. Mathematical Programming 2002, 94(1):41-69.
2. Barahona F., Anbil R. The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming 2000, 87(3):385-399.
3. Bish E. A multiple-crane-constrained scheduling problem in a container terminal. European Journal of Operational Research 2003, 144(1):83-107.
4. Bish E., Chen F., Leong Y., Nelson B., Ng J., Simchi-Levi D. Dispatching vehicles in a mega container terminal. OR Spectrum 2005, 27(4):491-506.
5. Bish E., Leong T., Li C., Ng J., Simchi-Levi D. Analysis of a new vehicle scheduling and location problem. Naval Research Logistics (NRL) 2001, 48(5):363-385.
6. Cao J., Lee D., Chen J., Shi Q. The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods. Transportation Research Part E: Logistics and Transportation Review 2010, 46(3):344-353.
7. Chen L., Bostel N., Dejax P., Cai J., Xi L. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research 2007, 181(1):40-58.
8. Fisher M.L. The lagrangian relaxation method for solving integer programming problems. Management Science 1981, 27(1):1-18.
9. Fisher M.L. The lagrangian relaxation method for solving integer programming problems. Management Science 2004, 50(12):1861-1871.
10. Gelareh, S., Lavrov, A., Merzouki, R., 2012a. Simulation Platform for Control Strategy Tuning of Intelligent and Autonomous Vehicles. Tech. Rep., LAGIS, Polytech'Lille.
11. Gelareh S., Maculan N., Mahey P., Monemi R.N. Hub-and-spoke network design and fleet deployment for string planning of liner shipping. Applied Mathematical Modelling 2012, 37(5):3307-3321.
12. Grunow M., Günther H., Lehmann M. Dispatching multi-load AGVs in highly automated seaport container terminals. OR Spectrum 2004, 26(2):211-235.
13. Grunow M., Günther H., Lehmann M. Strategies for dispatching AGVs at automated seaport container terminals. Container Terminals and Cargo Systems 2007, 155-178.
14. Guignard M. Lagrangian relaxation. TOP 2003, 11(2):151-228.
15. Hartmann S. A general framework for scheduling equipment and manpower at container terminals. OR Spectrum 2004, 26(1):51-74.
16. Held M., Karp R. The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming 1971, 1(1):6-25.
17. Kim K., Bae J. A dispatching method for automated guided vehicles to minimize delays of containership operations. International Journal of Management Science 1999, 5(1):1-25.
18. Kim K., Bae J. A look-ahead dispatching method for automated guided vehicles in automated port container terminals. Transportation Science 2004, 38(2):224.
19. Larsson T., Patriksson M., Strömberg A. Ergodic, primal convergence in dual subgradient schemes for convex programming. Mathematical Programming 1999, 86(2):283-312.
20. Lee L., Chew E., Tan K., Wang Y. Vehicle dispatching algorithms for container transshipment hubs. OR Spectrum 2010, 32(3):663-685.
21. Lemarechal C. An extension of Davidon methods to non differentiable problems. Nondifferentiable Optimization 1975, 95-109.
22. Meersmans, P., Wagelmans, A., 2001a. Dynamic Scheduling of Handling Equipment at Automated Container Terminals. ERIM Report Series Reference No. ERS-2001-69-LIS.
23. Meersmans, P., Wagelmans, A., 2001b. Effective Algorithms for Integrated Scheduling of Handling Equipment at Automated Container Terminals. Erasmus Research Institute of Management, Erasmus Universiteit.
24. Michelon P., Maculan N. Lagrangian decomposition for integer nonlinear programming with linear constraints. Mathematical Programming 1991, 52(1):303-313.
25. Narasimhan A., Palekar U.S. Analysis and algorithms for the transtainer routing problem in container port operations. Transportation Science 2002, 36(1):63-78.
26. Ng W., Mak K., Zhang Y. Scheduling trucks in container terminals using a genetic algorithm. Engineering Optimization 2007, 39(1):33-47.
27. Nguyen V., Kim K. A dispatching method for automated lifting vehicles in automated port container terminals. Computers & Industrial Engineering 2009, 56(3):1002-1020.
28. Reinoso, H., Maculan, N., 1992. Lagrangian decomposition in integer linear programming: a new scheme. In: INFOR, vol. 30.