Integrated planning of loaded and empty container movements
From MaRDI portal
Publication:1944871
DOI10.1007/s00291-012-0284-5zbMath1263.90040OpenAlexW2046777149MaRDI QIDQ1944871
An Caris, Kris Braekers, Gerrit K. Janssens
Publication date: 28 March 2013
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/14633
Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items (9)
Optimization of the drayage problem using exact methods ⋮ Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem ⋮ A multiperiod drayage problem with customer-dependent service periods ⋮ An integral LP relaxation for a drayage problem ⋮ The multi-trip container drayage problem with synchronization for efficient empty containers re-usage ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review ⋮ Combined strip and discharge delivery of containers in heterogeneous fleets with time windows ⋮ A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem ⋮ A truck scheduling problem arising in intermodal container transportation
Cites Work
- Unnamed Item
- A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Improved modeling and solution methods for the multi-resource routing problem
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- An optimization approach for planning daily drayage operations
- Heuristic-based truck scheduling for inland container transportation
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- A threshold accepting metaheuristic for the vehicle routing problem with time windows.
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- Fleet sizing and vehicle routing for container transportation in a static environment
- Look-ahead strategies for dynamic pickup and delivery problems
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- The multiple TSP with time windows: vehicle bounds based on precedence graphs
- A solution approach for log truck scheduling based on composite pricing and branch and bound
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- Dynamic and Stochastic Models for the Allocation of Empty Containers
This page was built for publication: Integrated planning of loaded and empty container movements
