A set covering based matheuristic for a real‐world city logistics problem

DOI10.1111/itor.12110zbMath1309.90010OpenAlexW2041622750WikidataQ59195715 ScholiaQ59195715MaRDI QIDQ5246831

Vittorio Maniezzo, Marco Antonio Boschetti

Publication date: 22 April 2015

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12110

zbMATH Keywords

Lagrangian relaxationset covering problemdual ascentmatheuristicscity logistics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

A-priori upper bounds for the set covering problem ⋮ Matheuristics: survey and synthesis ⋮ A matheuristic for the MinMax capacitated open vehicle routing problem ⋮ Vehicle routing problems with multiple trips ⋮ Vehicle routing problems with multiple trips ⋮ Route relaxations on GPU for vehicle routing problems ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints

Uses Software

• OR-Library
• VRP

Cites Work

• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
• A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• A dual ascent procedure for the set partitioning problem
• A probabilistic heuristic for a computationally difficult set covering problem
• An exact algorithm for the simplified multiple depot crew scheduling problem
• Benders decomposition, Lagrangean relaxation and metaheuristic design
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A Set Partitioning Approach to the Crew Scheduling Problem
• A Heuristic Method for the Set Covering Problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• Computer Solutions of the Traveling Salesman Problem
• Algorithms for the set covering problem

This page was built for publication: A set covering based matheuristic for a real‐world city logistics problem