Integrated planning of loaded and empty container movements
From MaRDI portal
Publication:1944871
Recommendations
- An optimization approach for planning daily drayage operations
- Heuristic-based truck scheduling for inland container transportation
- Optimization of the drayage problem using exact methods
- A tabu search heuristic for the inland container transportation problem
- A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
Cites work
- scientific article; zbMATH DE number 915580 (Why is no real title available?)
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- A solution approach for log truck scheduling based on composite pricing and branch and bound
- A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- A threshold accepting metaheuristic for the vehicle routing problem with time windows.
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- An Exchange Heuristic for Routeing Problems with Time Windows
- An optimization approach for planning daily drayage operations
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Dynamic and Stochastic Models for the Allocation of Empty Containers
- Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
- Fleet sizing and vehicle routing for container transportation in a static environment
- Heuristic-based truck scheduling for inland container transportation
- Improved modeling and solution methods for the multi-resource routing problem
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- Look-ahead strategies for dynamic pickup and delivery problems
- Multi-depot vehicle scheduling problems with time windows and waiting costs
- New savings based algorithms for time constrained pickup and delivery of full truckloads.
- The multiple TSP with time windows: vehicle bounds based on precedence graphs
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
Cited in
(21)- Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
- Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review
- Model predictive control for simultaneous planning of container and vehicle routes
- Improved modeling and solution methods for the multi-resource routing problem
- Multi-start heuristics for unit-capacity orienteering problems
- 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 bi-objective model for robust local container drayage problem
- An optimization approach for planning daily drayage operations
- Load planning for shipments of low density products
- The dynamic stochastic container drayage problem with truck appointment scheduling
- Optimization of the drayage problem using exact methods
- A multiperiod drayage problem with customer-dependent service periods
- A tabu search heuristic for the inland container transportation problem
- Heuristic-based truck scheduling for inland container transportation
- Scheduling drayage operations in synchromodal transport
- A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks
- A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition
- The multi-trip container drayage problem with synchronization for efficient empty containers re-usage
- A truck scheduling problem arising in intermodal container transportation
- An integral LP relaxation for a drayage problem
This page was built for publication: Integrated planning of loaded and empty container movements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944871)