Two-echelon vehicle routing problem with satellite bi-synchronization

DOI10.1016/j.ejor.2020.06.019zbMath1487.90131OpenAlexW3038102300MaRDI QIDQ2028760

Jun Chen, Ming Bai, Hao-Tian Wang, Hong-Qi Li

Publication date: 3 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.019

zbMATH Keywords

routingmixed-integer programmingadaptive large neighborhood searchtwo-echelon networksatellite synchronization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Integrating order delivery and return operations for order fulfillment in an online retail environment ⋮ The rendezvous vehicle routing problem ⋮ Directions for future research on urban mobility and city logistics ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization ⋮ Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review ⋮ Van-based robot hybrid pickup and delivery routing problem ⋮ Two-echelon vehicle routing problems: a literature review

Uses Software

• CPLEX

Cites Work

• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• A survey on two-echelon routing problems
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• A large neighbourhood based heuristic for two-echelon routing problems
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
• Location-routing: issues, models and methods
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
• The electric two-echelon vehicle routing problem
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• New valid inequalities for the two-echelon capacitated vehicle routing problem
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
• New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

This page was built for publication: Two-echelon vehicle routing problem with satellite bi-synchronization