Branch‐and‐Cut POPMUSIC for the Electric Vehicle Routing Problem With Time Windows
ABSTRACT Advancements in computer hardware and commercial software have enabled the use of branch‐and‐cut (BC) methodologies to address medium‐scale vehicle routing problems (VRPs). Despite the introduction of efficient heuristics in the literature, tailoring these approaches to suit various VRP variants, such as the electric vehicle routing problem ...
Lelisa Kebena Bijiga +2 more
wiley +1 more source
Research on a fuzzy programming model and algorithm for berth allocation considering time-varying water depth. [PDF]
Liu D, Li B, Li M, Lei Y, Yu P, Tan C.
europepmc +1 more source
A Supervised Learning Framework for Accelerating Solvers and Metaheuristics in Routing Problems
ABSTRACT Routing problems such as the traveling salesman problem (TSP) and the capacitated vehicle routing problem (CVRP) are computationally challenging due to the exponential growth of their feasible solution spaces with increasing instance size.
Johannes Gückel +2 more
wiley +1 more source
Designing a Food Frequency Questionnaire for a Vegetarian Population in Germany by Means of Mixed-Integer Linear Programming. [PDF]
Blaurock J, Heuer T, Gedrich K.
europepmc +1 more source
Exact Solution of Picker Routing Problems in Zoned Warehouses With Scattered Storage
ABSTRACT We present two picker routing problems in a warehouse split into multiple disjoint zones with a picker assigned to each zone. Scattered storage is applied, meaning an article can be stored at several pick positions in one or more zones, and capacity restrictions limit the number of collected articles for each picker.
Laura Lüke
wiley +1 more source
An open-source optimization model for sustainable open-pit mine production scheduling. [PDF]
Lotsu JS, Bimpong GY, Boakye K.
europepmc +1 more source
ABSTRACT The Traveling Salesman problem with pickup, delivery, and ride‐time constraints (TSPPD‐RT) requires a depot‐based vehicle to visit multiple known requests. Each request specifies a pickup vertex, corresponding delivery vertex, and maximum travel time between them (ride‐time). The goal is to find a tour that (i) starts and finishes at the depot,
Xinbo Zhang, Roberto Baldacci
wiley +1 more source
Integrated continuous berth allocation with time-invariant specific quay crane assignment using a mixed-integer model and greedy genetic algorithm. [PDF]
Zhou Y, Cheng X, Cao Y.
europepmc +1 more source
The Two‐Echelon Multicommodity Location‐Routing Problem With Stochastic and Correlated Demands
ABSTRACT This study introduces the two‐echelon multicommodity location routing problem with stochastic and correlated demands. We propose a two‐stage stochastic programming formulation, with second‐echelon facilities location and commodity allocation decisions defining the first stage, while recourse decisions, which are made in the second stage ...
David Escobar‐Vargas +3 more
wiley +1 more source
Research on optimization of train routing problem for railway hubs considering passenger demand. [PDF]
Wang Y.
europepmc +1 more source

