A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
From MaRDI portal
Publication:2160517
DOI10.1016/j.ejor.2022.03.058OpenAlexW4223539857WikidataQ113875411 ScholiaQ113875411MaRDI QIDQ2160517
Lixin Miao, Michael G. H. Bell, Canrong Zhang, Mengtong Wang
Publication date: 3 August 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.03.058
Uses Software
Cites Work
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
- Battery swap station location-routing problem with capacitated electric vehicles
- A large neighbourhood based heuristic for two-echelon routing problems
- The fleet size and mix vehicle routing problem
- A column generation approach for the location-routing problem with time windows
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
- The vehicle routing-allocation problem: A unifying framework
- Robust combinatorial optimization with variable budgeted uncertainty
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
- An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
- A survey of variants and extensions of the location-routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- The Capacitated m-Ring-Star Problem
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- A column generation approach for the split delivery vehicle routing problem
This page was built for publication: A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
