4.5 Article

Branch-Price-and-Cut-Based Solution of Order Batching Problems

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Engineering, Industrial

An evaluation of several combinations of routing and storage location assignment policies for the order batching problem

Ufuk Bahceci et al.

Summary: In this study, customized Mixed Integer Linear Programming (MILP) formulations were developed for the Order Batching Problem (OBP) for the first time, considering various routing policies. A novel picker routing policy named mixed policy was introduced. Extensive computational experiments were conducted to analyze the impact of different routing and storage policies under various operating conditions, leading to several managerial insights.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2022)

Article Operations Research & Management Science

A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing

Katrin Hessler et al.

Summary: This article presents a study on the dynamic programming algorithm for optimal picker routing, which has linear complexity in the number of aisles. The algorithm is linear in solving the dynamic programming problem, but computing the cost coefficients requires considering all picking positions.

OPERATIONS RESEARCH LETTERS (2022)

Article Mathematics, Applied

A branch-and-cut algorithm for the soft-clustered vehicle-routing problem

Katrin Hessler et al.

Summary: The soft-clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem, with a novel symmetric formulation and an asymmetric sub-model for clustering. A branch-and-cut algorithm is used to solve the new model, with problem-specific cutting planes and separation procedures introduced. Computational results show that the algorithm can now solve several previously open instances to proven optimality.

DISCRETE APPLIED MATHEMATICS (2021)

Article Computer Science, Interdisciplinary Applications

The joint order batching and picker routing problem: Modelled and solved as a clustered vehicle routing problem

Babiche Aerts et al.

Summary: The research focuses on the joint order batching and picker routing problem (JOBPRP) in a warehouse environment, using a two-level variable neighborhood search (2level-VNS) metaheuristic algorithm. Comparing different batching criteria, it is concluded that the minimum aisles criterion is more suitable for JOBPRP in warehouse contexts.

COMPUTERS & OPERATIONS RESEARCH (2021)

Article Management

Exact solution of the soft-clustered vehicle-routing problem

Timo Hintsch et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2020)

Review Management

Warehousing in the e-commerce era: A survey

Nils Boysen et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

Review Operations Research & Management Science

Robotized and Automated Warehouse Systems: Review and Recent Developments

Kaveh Azadeh et al.

TRANSPORTATION SCIENCE (2019)

Article Management

Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem

Timo Gschwind et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for the order picking problem

Lucie Pansart et al.

COMPUTERS & OPERATIONS RESEARCH (2018)

Article Management

A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem

Ivan Zulj et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

Article Management

Stabilized branch-and-price algorithms for vector packing problems

Katrin Hessler et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

Article Management

The two-dimensional vector packing problem with general costs

Qian Hu et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2018)

Article Management

Optimally solving the joint order batching and picker routing problem

Cristiano Arbex Valle et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2017)

Proceedings Paper Computer Science, Theory & Methods

Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories

Cristiano Arbex Valle et al.

COMBINATORIAL OPTIMIZATION, ISCO 2016 (2016)

Article Engineering, Industrial

An exact solution approach for the order batching problem

Ibrahim Muter et al.

IIE TRANSACTIONS (2015)

Article Management

Investigating order picking system adoption: a case-study-based approach

Gino Marchet et al.

INTERNATIONAL JOURNAL OF LOGISTICS-RESEARCH AND APPLICATIONS (2015)

Article Engineering, Industrial

Order picking under random and turnover-based storage policies in fishbone aisle warehouses

Melih Celik et al.

IIE TRANSACTIONS (2014)

Article Computer Science, Interdisciplinary Applications

Improved bounds for large scale capacitated arc routing problem

Rafael Martinelli et al.

COMPUTERS & OPERATIONS RESEARCH (2013)

Article Management

Tabu search heuristics for the order batching problem in manual order picking systems

Sebastian Henn et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)

Article Engineering, Industrial

Large-scale order batching in parallel-aisle picking systems

Soondo Hong et al.

IIE TRANSACTIONS (2012)

Article Management

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

Roberto Baldacci et al.

OPERATIONS RESEARCH (2011)

Article Operations Research & Management Science

Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows

C. Archetti et al.

TRANSPORTATION SCIENCE (2011)

Review Management

Research on warehouse design and performance evaluation: A comprehensive review

Jinxiang Gu et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

Article Computer Science, Software Engineering

An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Roberto Baldacci et al.

MATHEMATICAL PROGRAMMING (2008)

Review Management

Design and control of warehouse order picking: A literature review

Rene de Koster et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2007)

Review Management

Selected topics in column generation

ME Lübbecke et al.

OPERATIONS RESEARCH (2005)

Article Engineering, Industrial

Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system

H Hwang et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2005)

Article Engineering, Industrial

Order batching to minimize total travel time in a parallel-aisle warehouse

N Gademann et al.

IIE TRANSACTIONS (2005)

Article Engineering, Industrial

An evaluation of routing policies for order-picking operations in low-level picker-to-part system

H Hwang et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2004)

Article Engineering, Industrial

A comparison of picking, storage, and routing policies in manual order picking

CG Petersen et al.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2004)

Article Management

Routing order pickers in a warehouse with a middle aisle

KJ Roodbergen et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2001)

Article Engineering, Industrial

Routing methods for warehouses with multiple cross aisles

KJ Roodbergen et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2001)

Article Engineering, Industrial

Optimal layout in low-level picker-to-part systems

F Caron et al.

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH (2000)