Exact and heuristic methods for optimizing lock-quay system in inland waterway
From MaRDI portal
Publication:1737520
DOI10.1016/j.ejor.2019.03.010zbMath1430.90269OpenAlexW2922475237MaRDI QIDQ1737520
Bin Ji, Yanbin Yuan, Xiaohui Lei, Tyrone Fernando, Xiaohui Yuan, Herbert Ho Ching Iu
Publication date: 23 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.03.010
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (6)
A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective ⋮ Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective ⋮ Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor
Uses Software
Cites Work
- A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
- Mathematical programming models for lock scheduling with an emission objective
- A set-partitioning-based model for the berth allocation problem under time-dependent limitations
- A combinatorial Benders' decomposition for the lock scheduling problem
- A survey of berth allocation and quay crane scheduling problems in container terminals
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem
- Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows
- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
- Future paths for integer programming and links to artificial intelligence
- Two-dimensional packing problems: a survey
- Exact and heuristic methods for placing ships in locks
- GSA: A gravitational search algorithm
- The two-dimensional bin packing problem with variable bin sizes and costs
- Simulation of alternative approaches to relieving congestion at locks in a river transportion system
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
This page was built for publication: Exact and heuristic methods for optimizing lock-quay system in inland waterway
