A location-or-routing problem with partial and decaying coverage

DOI10.1016/j.cor.2022.106041OpenAlexW4297932798MaRDI QIDQ2108134

Gilbert Laporte, Maryam Haghi, Okan Arslan

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106041

zbMATH Keywords

locationroutingadaptive large neighborhood searchdecaying coverage

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A survey of recent research on location-routing problems
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• 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 Branch-and-Cut method for the Capacitated Location-Routing Problem
• The multi-vehicle probabilistic covering tour problem
• Location-routing: issues, models and methods
• The bi-objective covering tour problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• The median tour and maximal covering tour problems: Formulations and heuristics
• The gradual covering decay location problem on a network.
• Solving the multi-vehicle multi-covering tour problem
• A simple and effective evolutionary algorithm for the capacitated location-routing problem
• A survey of the standard location-routing problem
• Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
• The bi-objective stochastic covering tour problem
• A computational comparison of flow formulations for the capacitated location-routing problem
• A maximal covering location model in the presence of partial coverage
• A column generation approach for location-routing problems with pickup and delivery
• Gradual cover competitive facility location
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices
• The location routing problem using electric vehicles with constrained distance
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• A survey of variants and extensions of the location-routing problem
• A taxonomical analysis, current methods and objectives on location-routing problems
• An Exact Method for the Capacitated Location-Routing Problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• The gradual covering problem
• Integer Programming Formulation of Traveling Salesman Problems
• The prize collecting traveling salesman problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• The Covering Tour Problem
• The Covering Salesman Problem
• The Traveling-Salesman Problem
• The generalized maximal covering location problem