☆ 4.7 Article

Dynamic pickup and delivery problem with transshipments and LIFO constraints

COMPUTERS & INDUSTRIAL ENGINEERING (2023)

相关参考文献

注意：仅列出部分参考文献，下载原文获取全部文献信息。

Review Management

The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation

Zefeng Lyu et al.

Summary: The paper investigates the pickup and delivery problem with transshipments, which is further extended to incorporate time windows and transshipments. Two existing models are reviewed and revised, and a new solution is developed. Experimental results demonstrate that the proposed approach outperforms existing models in terms of solution quality and computing time.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

添加到收藏夹

Article Management

The pickup and delivery problem with time windows, multiple stacks, and handling operations

Marilene Cherkesly et al.

Summary: This paper introduces, models and solves the pickup and delivery problem with time windows, multiple stacks, and handling operations. It proposes a solution methodology and conducts extensive tests and evaluations.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

添加到收藏夹

Article Management

Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

Armando Honorio Pereira et al.

Summary: The study focused on valid inequalities and exact algorithms for the pickup and delivery traveling salesman problem with multiple stacks. New formulations and valid inequalities were proposed, and computational experiments showed that the implemented algorithm outperformed all other competing exact algorithms for the problem.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Evolutionary neural network for learning of scalable heuristics for pickup and delivery problems with time windows

Sungbum Jun et al.

Summary: In this paper, a machine learning approach called ENSIGHT is proposed for solving the pickup and delivery problem with time windows and heterogenous vehicles. Experimental results show that ENSIGHT outperforms other machine learning techniques and current dispatching rules, and is effective in learning scalable heuristics.

COMPUTERS & INDUSTRIAL ENGINEERING (2022)

添加到收藏夹

Article Management

The Pickup and Delivery Problem with Split Loads and Transshipments: A Branch-and-Cut Solution Approach

David Wolfinger et al.

Summary: This paper discusses the design of routes for a fleet of vehicles serving customer requests, targeting to minimize the sum of travel costs and transshipment costs. An arc-based mixed-integer formulation and a branch-and-cut algorithm are proposed and extensively tested to showcase the algorithm's performance.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Waiting strategy for the vehicle routing problem with simultaneous pickup and delivery using genetic algorithm

Hyungbin Park et al.

Summary: With the widespread use of smartphones and the popularity of online shopping, consumers are increasingly shifting towards online purchases, resulting in a growing volume and variety of products being delivered. Companies in the logistics sector need to develop operational strategies to cope with the increasing demand, with a focus on real-world vehicle routing problems involving dynamic orders.

EXPERT SYSTEMS WITH APPLICATIONS (2021)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A routing and scheduling problem for cross-docking networks with perishable products, heterogeneous vehicles and split delivery

Reza Shahabi-Shahmiri et al.

Summary: The paper introduces a new multi-objective mixed-integer programming (MIP) model for efficient scheduling and routing of perishable goods in cross-docking systems. By considering actual business operations and setting deadlines, the model aims to reduce distribution costs, accelerate processing time, and maximize network capacity utilization.

COMPUTERS & INDUSTRIAL ENGINEERING (2021)

添加到收藏夹

Article Economics

A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem

Xingbin Zhan et al.

Summary: Ride-hailing sharing optimizes the number of served customers while minimizing total travel cost by grouping customers with similar trips and time schedules. The study shows that considering both travel cost and travel time ratios in the objective function can achieve better sharing outcomes, allowing passengers to save significantly on costs through ride-hailing sharing.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)

添加到收藏夹

Article Computer Science, Artificial Intelligence

Assignment of attribute weights with belief distributions for MADM under uncertainties

Mi Zhou et al.

KNOWLEDGE-BASED SYSTEMS (2020)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading

Bo Peng et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2020)

添加到收藏夹

Article Engineering, Manufacturing

A periodic optimization approach to dynamic pickup and delivery problems with time windows

Farzaneh Karami et al.

JOURNAL OF SCHEDULING (2020)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Dynamic courier routing for a food delivery service

Zachary Steever et al.

COMPUTERS & OPERATIONS RESEARCH (2019)

添加到收藏夹

Article Management

A probabilistic approach to pickup and delivery problems with time window uncertainty

Peter Gyorgyi et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A multi-start heuristic for the ship routing and scheduling of an oil company

Denise Yamashita et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2019)

添加到收藏夹

Article Automation & Control Systems

A hybrid particle swarm optimization for the selective pickup and delivery problem with transfers

Zhihao Peng et al.

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE (2019)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Capacitated and multiple cross-docked vehicle routing problem with pickup, delivery, and time windows

Azadeh Ahkamiraad et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2018)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Two-echelon vehicle routing problem with simultaneous pickup and delivery: Mathematical model and heuristic approach

Onder Belgin et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2018)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A comparison of two meta-heuristics for the pickup and delivery problem with transshipment

N. Danloup et al.

COMPUTERS & OPERATIONS RESEARCH (2018)

添加到收藏夹

Article Management

Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands

Lin Zhu et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2018)

添加到收藏夹

Article Operations Research & Management Science

Improved solutions to dynamic and stochastic maritime pick-up and delivery problems using local search

Gregorio Tirado et al.

ANNALS OF OPERATIONS RESEARCH (2017)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking

Philippe Grangier et al.

COMPUTERS & OPERATIONS RESEARCH (2017)

添加到收藏夹

Article Management

A long-haul freight transportation problem: Synchronizing resources to deliver requests passing through multiple transshipment locations

F. Neves-Moreira et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

添加到收藏夹

Article Management

Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks

Marilene Cherkesly et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2016)

添加到收藏夹

Article Management

Exact approaches for the pickup and delivery problem with loading cost

Li Xue et al.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2016)

添加到收藏夹

Article Economics

Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations

Monirehalsadat Mahmoudi et al.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2016)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Two solution representations for solving multi-depot vehicle routing problem with multiple pickup and delivery requests via PSO

Voratas Kachitvichyanukul et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2015)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading

Marilene Cherkesly et al.

COMPUTERS & OPERATIONS RESEARCH (2015)

添加到收藏夹

Article Management

The multiple vehicle pickup and delivery problem with LIFO constraints

Enrique Benavent et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)

添加到收藏夹

Article Management

A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes

Renaud Masson et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)

添加到收藏夹

Article Management

New mixed integer-programming model for the pickup-and-delivery problem with transshipment

A. Rais et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)

添加到收藏夹

Article Economics

Real-time control of express pickup and delivery processes in a dynamic environment

Francesco Ferrucci et al.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2014)

添加到收藏夹

Article Operations Research & Management Science

An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Renaud Masson et al.

TRANSPORTATION SCIENCE (2013)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs

Gunes Erdogan et al.

COMPUTERS & OPERATIONS RESEARCH (2012)

添加到收藏夹

Article Computer Science, Interdisciplinary Applications

A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment

Yuan Qu et al.

COMPUTERS & OPERATIONS RESEARCH (2012)

添加到收藏夹

Article Management

Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints

Brenda Cheang et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2012)

添加到收藏夹

Review Management

Dynamic pickup and delivery problems

Gerardo Berbeglia et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

添加到收藏夹

Article Management

The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method

Cristian E. Cortes et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)

添加到收藏夹

© Peeref 2019-2024. All rights reserved.