DCA for solving the scheduling of lifting vehicle in an automated port container terminal

DOI10.1007/s10287-012-0140-8zbMath1273.90161OpenAlexW1966143178MaRDI QIDQ373199

Adnan Yassine, Riadh Moussi, Hoai Minh Le

Publication date: 21 October 2013

Published in: Computational Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10287-012-0140-8

zbMATH Keywords

DCAbranch and boundautomated lifting vehiclecontainer port terminalprogrammation DC

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

DC programming and DCA: thirty years of developments

Cites Work

• Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Comparison of vehicle types at an automated container terminal
• Exact penalty in d. c. programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• An optimization model for storage yard management in transshipment hubs
• A continuous approch for globally solving linearly constrained quadratic

This page was built for publication: DCA for solving the scheduling of lifting vehicle in an automated port container terminal