POPMUSIC for the world location-routing problem

The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. In order to address it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programming formulation. POPMU-SIC is an efficient metaheuristic that may serve as blueprint for matheuristics approaches once hybridized with mathematical programming. In this regard, the use of exact methods for solving the sub-problems defined in the POPMUSIC template highlight an interoperation between metaheuristics and mathematical programming techniques, which provide a new type of approach for this problem. The computational experiments reveal excellent results.

show abstract

“…With these definitions the GSPP formulation of the BAP presented in [3] is stated as follows. minimize w∈Ω c w x w (1) subject to…”

Section: Generalized Set-partitioning Problem Formulationmentioning

confidence: 99%

POPMUSIC as a matheuristic for the berth allocation problem

Lalla-Ruiz

Voβ

2014

Ann Math Artif Intell

View full text Add to dashboard Cite

show abstract

“…For example, it is not clear how to meaningfully order the subproblems. One early work in this direction demonstrated that a last-in-first-out stack order performs better than random [3].…”

Section: Related Workmentioning

confidence: 99%

Learning to Delegate for Large-scale Vehicle Routing

Li¹,

Yan²,

Wu³

2021

Preprint

View full text Add to dashboard Cite

Vehicle routing problems (VRPs) are a class of combinatorial problems with wide practical applications. While previous heuristic or learning-based works achieve decent solutions on small problem instances of up to 100 customers, their performance does not scale to large problems. This article presents a novel learningaugmented local search algorithm to solve large-scale VRP. The method iteratively improves the solution by identifying appropriate subproblems and delegating their improvement to a black box subsolver. At each step, we leverage spatial locality to consider only a linear number of subproblems, rather than exponential. We frame subproblem selection as a regression problem and train a Transformer on a generated training set of problem instances. We show that our method achieves state-of-the-art performance, with a speed-up of up to 15 times over strong baselines, on VRPs with sizes ranging from 500 to 3000. * Equal Contribution Preprint. Under review.

show abstract

“…Matheuristics have been used successfully in routing problems [3]. In this context, POPMUSIC has been successfully utilized in various studies associated with the VRP (see [2,22,29]) for address large instances by decomposing them into a set of parts.…”

Section: Related Workmentioning

confidence: 99%

Optimization of Green Pickup and Delivery Operations in Multi-depot Distribution Problems

Gil

Lalla-Ruiz

Mes

et al. 2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this work, the Multi-Depot Green VRP with Pickups and Deliveries (MDGVRP-PD) is studied. It is a routing optimization problem in which the objective is to construct a set of vehicle routes considering multiple depots and one-to-one pickup and delivery operations that minimize emissions through fuel consumption, which depends on weight and travel distance. In one-to-one problems, goods must be transported between a single origin and its single associated destination. Practical considerations imply addressing the pickup and delivery of customers from multiple depots, where a logistics service company can efficiently combine its resources, thus reducing environmental pollution. To tackle this problem, we develop a mathematical programming formulation and matheuristic approach based on the POPMUSIC (Partial Optimization Metaheuristic under Special Intensification Conditions) framework. The results show that if the weight carried on the routes as part of the fitness measure is considered, our matheuristic approach provide an average percentage improvement in emissions of 30.79%, compared to a fitness measure that only takes into account the distances of the routes.

show abstract

POPMUSIC for the world location-routing problem

Cited by 17 publications

References 17 publications

POPMUSIC as a matheuristic for the berth allocation problem

POPMUSIC as a matheuristic for the berth allocation problem

Learning to Delegate for Large-scale Vehicle Routing

Optimization of Green Pickup and Delivery Operations in Multi-depot Distribution Problems

Contact Info

Product

Resources

About