A local search heuristic for the pre- and end-haulage of intermodal container terminals
From MaRDI portal
(Redirected from Publication:1017451)
Recommendations
- scientific article; zbMATH DE number 1189257
- Efficient model and heuristic for the intermodal terminal location problem
- scientific article; zbMATH DE number 4167870
- A feasibility-based heuristic for the container pre-marshalling problem
- A tabu search heuristic for the inland container transportation problem
- Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals
- Efficient metaheuristics to solve the intermodal terminal location problem
- Novel models and algorithms for location assignment for outbound containers in container terminals
Cites work
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- A classification scheme for vehicle routing and scheduling problems
- A guide to vehicle routing heuristics
- A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and 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
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- Formulations and exact algorithms for the vehicle routing problem with time windows
- Handbooks in operations Research \& management science: Transportation
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- Opportunities for OR in intermodal freight transport research: A review.
- The General Pickup and Delivery Problem
- The pickup and delivery problem with time windows
Cited in
(15)- A multiperiod drayage problem with customer-dependent service periods
- A truck scheduling problem arising in intermodal container transportation
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- The multi-trip container drayage problem with synchronization for efficient empty containers re-usage
- Optimization of the drayage problem using exact methods
- 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
- Simulation and optimisation of intermodal barge transport networks
- A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
- An integral LP relaxation for a drayage problem
- Heuristic-based truck scheduling for inland container transportation
- Efficient metaheuristics to solve the intermodal terminal location problem
- Integrated planning of loaded and empty container movements
- Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
- The multi-period multi-trip container drayage problem with release and due dates
This page was built for publication: A local search heuristic for the pre- and end-haulage of intermodal container terminals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017451)
