A local search heuristic for the pre- and end-haulage of intermodal container terminals
From MaRDI portal
Publication:1017451
DOI10.1016/j.cor.2008.12.007zbMath1160.90313OpenAlexW2010237370MaRDI QIDQ1017451
Publication date: 19 May 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.007
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
Optimization of the drayage problem using exact methods ⋮ Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem ⋮ An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ 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 ⋮ Integrated planning of loaded and empty container movements ⋮ Simulation and optimisation of intermodal barge transport networks ⋮ Heuristic-based truck scheduling for inland container transportation ⋮ 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 two-stage hybrid heuristic solution for the container drayage problem with trailer reposition ⋮ 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
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A classification scheme for vehicle routing and scheduling problems
- The pickup and delivery problem with time windows
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- Opportunities for OR in intermodal freight transport research: A review.
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- Formulations and exact algorithms for the vehicle routing problem with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A guide to vehicle routing heuristics
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- The General Pickup and Delivery Problem
