A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
From MaRDI portal
Publication:2432884
DOI10.1016/J.EJOR.2005.06.044zbMATH Open1137.90693OpenAlexW2068132295MaRDI QIDQ2432884FDOQ2432884
Authors: Akio Imai, Etsuko Nishimura, John R. Current 
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.044
Recommendations
- Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
- scientific article; zbMATH DE number 4085396
- An efficient Lagrangean heuristic for rental vehicle scheduling
- scientific article; zbMATH DE number 1057930
- Packing first, routing second -- a heuristic for the vehicle routing and loading problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Title not available (Why is that?)
- A survey of algorithms for the generalized assignment problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
- The vehicle routing problem with backhauls
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- An exact method for the vehicle routing problem with backhauls
- The Rollon-Rolloff vehicle routing problem
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- Title not available (Why is that?)
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- Optimal sequencing of skip collections and deliveries
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- The vehicle-routing problem with delivery and back-haul options
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing
- A Routing Model for Pickups and Deliveries: No Capacity Restrictions on the Secondary Items
Cited In (28)
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- Generalized mixed integer and VNS heuristic approach to solving the multisize containers drayage problem
- Blood supply planning during natural disasters under uncertainty: a novel bi-objective model and an application for red crescent
- Mathematical programming based heuristics for the 0--1 MIP: a survey
- Integrated planning of loaded and empty container movements
- An efficient Lagrangean heuristic for rental vehicle scheduling
- A local search heuristic for the pre- and end-haulage of intermodal container terminals
- Path planning and vehicle scheduling optimization for logistic distribution of hazardous materials in full container load
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- 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
- The dynamic stochastic container drayage problem with truck appointment scheduling
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
- Optimization of the drayage problem using exact methods
- A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
- A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems
- A multiperiod drayage problem with customer-dependent service periods
- Integrating train service route design with passenger flow allocation for an urban rail transit line
- Heuristic-based truck scheduling for inland container transportation
- Operations research at container terminals: a literature update
- Mixed-integer linear optimization for full truckload pickup and delivery
- A heuristic solution for the yearly capacity of an intermodal terminal
- An inventory-routing problem with the objective of travel time minimization
- 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
- The multi-period multi-trip container drayage problem with release and due dates
Uses Software
This page was built for publication: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432884)
