4.5 Article

POPMUSIC for a real-world large-scale vehicle routing problem with time windows

期刊

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 60, 期 7, 页码 934-943

出版社

PALGRAVE MACMILLAN LTD
DOI: 10.1057/palgrave.jors.2602633

关键词

vehicle routing; heuristics; problem decomposition

向作者/读者索取更多资源

This paper presents a heuristic approach based on the POPMUSIC framework for a large-scale Multi Depot Vehicle Routing Problem with Time Windows derived from real-world data. POPMUSIC is a very powerful tool for tackling large problem instances. A Memetic Algorithm is used as an optimizer in the POPMUSIC framework. It is shown that a population-based search combined with decomposition strategies is a very efficient and flexible tool to tackle real-world problems with regards to solution quality as well as runtime. Journal of the Operational Research Society ( 2009) 60, 934-943. doi:10.1057/palgrave.jors.2602633

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Operations Research & Management Science

A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints

Alexandre M. Florio, Richard F. Hartl, Stefan Minner, Juan-Jose Salazar-Gonzalez

Summary: This paper addresses the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints (VRPSD-PDC) and presents a solution using a novel branch-and-price algorithm. Computational experiments are conducted with different demand probability distributions and duration constraints levels. The optimal solutions may involve routes serving demands exceeding vehicle capacity, utilizing optimal restocking to reduce costs. Sensitivity analysis shows that high demand variability negatively affects the solution in terms of cost and number of routes.

TRANSPORTATION SCIENCE (2021)

Article Operations Research & Management Science

The vehicle routing problem with heterogeneous locker boxes

Jasmin Grabenschweiger, Karl F. Doerner, Richard F. Hartl, Martin W. P. Savelsbergh

Summary: By utilizing a system with alternative delivery points such as locker box stations, logistic efficiency and customer convenience can be improved while minimizing costs. The system allows customers to choose between home delivery and locker box pickup, offering compensation options and considering parcel sizes and slot availability. Mathematical formulation and metaheuristic solutions can help optimize the last-mile delivery process efficiently.

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2021)

Article Computer Science, Interdisciplinary Applications

The pickup and delivery problem with alternative locations and overlapping time windows

Alina G. Dragomir, Tom Van Woensel, Karl F. Doerner

Summary: Online second-hand marketplaces have experienced a significant increase in transactions, but private buyers and sellers in C2C settings may face inconveniences in sending and receiving parcels. This paper proposes a solution approach based on a multi-start, adaptive, large neighborhood search with problem specific operators to solve the pickup and delivery problem with alternative locations. By comparing with similar problems and analyzing real data, the study finds that increasing flexibility and convenience for customers can result in cost savings of up to 30% for carriers.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Management

A Large Neighbourhood Search Metaheuristic for the Contagious Disease Testing Problem

David Wolfinger, Margaretha Gansterer, Karlf. Doerner, Nikolas Popper

Summary: This article addresses the logistics problem in COVID-19 testing, introduces the contagious disease testing problem (CDTP), and presents a solution. By optimizing the opening of test centers and routes of mobile test teams to minimize costs, the efficiency of public health response to pandemics can be improved.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Management

Comparison of anticipatory algorithms for a dial-a-ride problem

Ulrike Ritzinger, Jakob Puchinger, Christian Rudloff, Richard F. Hartl

Summary: Progress in digitalization provides opportunities for capturing transportation logistics data and improving decision support in transportation services. In this study, we propose different anticipatory algorithms for a dynamic and stochastic patient transportation problem and analyze their performance in a real-world application. The experimental results show that incorporating information about future requests enhances solution quality, and simple waiting strategies are most suitable for highly dynamic environments.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Engineering, Industrial

A genetic programming learning approach to generate dispatching rules for flexible shop scheduling problems

Roland Braune, Frank Benda, Karl F. Doerner, Richard F. Hartl

Summary: This paper presents a Genetic Programming approach for solving flexible shop scheduling problems, generating priority rules for job dispatching and minimizing the makespan. Through testing on benchmark problem settings and a special industrial case, along with comparison between single-tree and multi-tree approaches, the study demonstrates consistent performance improvements over existing priority rules.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2022)

Article Engineering, Industrial

Reputation or warranty, what is more effective against planned obsolescence?

Richard F. Hartl, Peter M. Kort, Stefan Wrzaczek

Summary: This paper studies the trade-off between durability and reputation for a firm, and analyzes the impact of government policy on firm decision making. The research finds that the length of warranty period, consumer awareness of warranty, and uncertainty about product breakdown all have effects on product lifetime.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2023)

Article Operations Research & Management Science

Transportation in the Sharing Economy

Margaretha Gansterer, Richard F. Hartl, Michal Tzur

Summary: Traditionally, there was a focus on owning resources, but now there is a trend towards sharing resources, especially in the transportation sector. Sharing resources can improve efficiency, reduce costs, and promote sustainability.

TRANSPORTATION SCIENCE (2022)

Article Management

Safe and secure vehicle routing: a survey on minimization of risk exposure

Georg E. A. Froehlich, Margaretha Gansterer, Karl F. Doerner

Summary: This study reviews and categorizes literature on safe and secure vehicle routing problems and provides a starting point for researchers in this field. The study reveals that the majority of related articles have been published in the last five years and cover various aspects such as transportation of hazardous materials, patrol routing, cash-in-transit, dissimilar routing problems, and modeling of multi-graphs. The paper also discusses relevant methods and instances, along with identifying future research directions.

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2023)

Article Operations Research & Management Science

Asymmetric Information in a Capital Accumulation Differential Game with Spillover and Learning Effects

Gustav Feichtinger, Richard F. Hartl, Peter M. Kort, Andrea Seidl, Stefan Wrzaczek

Summary: This paper examines the impact of a firm's own capital stock and its competitor's capital stock on investment in a capital accumulation game. The study finds that if a firm acknowledges that its own capital stock increases the efficiency of the competitor's investments, the firm will invest less.

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2022)

Article Computer Science, Interdisciplinary Applications

A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows

Emilio J. Alarcon Ortega, Karl F. Doerner

Summary: This article addresses a continuous-time variant of the inventory routing problem under stochastic demands. The problem at hand considers continuous decrease of inventory during the period due to customer demand. A two-stage mathematical program is formulated to manage replenishment decisions and reduce costs. An adaptive large neighborhood search algorithm is developed to find solutions, and the impact of using recourse actions to handle lost sales is evaluated. The algorithm's performance is compared with other algorithms from the literature, considering stochastic demands, and efficiency and levels of stochasticity are analyzed.

COMPUTERS & OPERATIONS RESEARCH (2023)

Article Management

Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut

Alexandre M. Florio, Michel Gendreau, Richard F. Hartl, Stefan Minner, Thibaut Vidal

Summary: This paper examines the stochastic variant of the Vehicle Routing Problem (VRP) called VRPSD, where demands are only revealed upon vehicle arrival at each customer. The paper summarizes recent progress in VRPSD research and introduces two major contributions: a branch-price-and-cut algorithm for optimal restocking and a demand model for correlated customer demands. Computational results demonstrate the effectiveness of the new algorithm and the potential cost savings of over 10% when considering demand correlation.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Management

The hammer and the jab: Are COVID-19 lockdowns and vaccinations complements or substitutes?

J. P. Caulkins, D. Grass, G. Feichtinger, R. F. Hartl, P. M. Kort, M. Kuhn, A. Prskawetz, M. Sanchez-Romero, A. Seidl, S. Wrzaczek

Summary: This paper explores the variation of lockdown policies during the gap between vaccine approval and complete vaccination. The study finds that the intensity and duration of lockdowns may increase or decrease as the rate of vaccine deployment increases, depending on other model parameters. Vaccines and lockdowns can act as substitutes or complements, depending on the specific conditions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Computer Science, Hardware & Architecture

A rolling horizon framework for the time-dependent multi-visit dynamic safe street snow plowing problem

Georg E. A. Frohlich, Margaretha Gansterer, Karl F. Doerner

Summary: In this study, we propose a novel time-dependent multi-visit dynamic safe street snow plowing problem and develop an adaptive large neighborhood search method to solve it. By examining real-world-based instances for Vienna, we find that different snowstorm movements do not significantly affect the choice of rolling horizon settings. Our findings also suggest that larger updating intervals are beneficial when prediction errors are low, and larger look-aheads are better suited for larger updating intervals.

NETWORKS (2023)

Article Computer Science, Interdisciplinary Applications

A hybrid metaheuristic solution approach for the cobot assignment and job shop scheduling problem

Alexander Kinast, Roland Braune, Karl F. Doerner, Stefanie Rinderle-Ma, Christian Weckenborg

Summary: A hybrid genetic algorithm was proposed to solve the task shop scheduling problem with cobots allocation, demonstrating that deploying additional robots can significantly improve production efficiency.

JOURNAL OF INDUSTRIAL INFORMATION INTEGRATION (2022)

暂无数据