Article
Computer Science, Artificial Intelligence
Shuo Sun, Liang Ma, Yong Liu, Chunjian Shang
Summary: The reverse logistics problem has gained increasing interest, and the proposed hybrid volleyball premier league (HVPL) algorithm offers a better solution to this problem.
APPLIED SOFT COMPUTING
(2023)
Article
Management
David Wolfinger, Juan-Jose Salazar-Gonzalez
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
Operations Research & Management Science
Amit Kohar, Suresh Kumar Jakhar
Summary: Online food delivery companies arrange pickup and delivery routes to meet customer demands, proposed an enhanced solution to find least cost vehicle routes, and demonstrated through computational experiments its efficiency in solving benchmark problems.
ANNALS OF OPERATIONS RESEARCH
(2021)
Article
Engineering, Industrial
Jian Zhou, Hui Li, Yujie Gu, Mingxuan Zhao, Xuehui Xie, Haoran Zheng, Xinghua Fang
Summary: This paper proposes a solution framework for the bi-objective vehicle routing problem with simultaneous delivery and pickup, utilizing fuzzy numbers and risk perspective to address the challenges faced in daily operations. A fuzzy chance-constraint programming model and a two-phase approach are introduced to tackle the problem effectively. Computational results show the competitiveness and efficiency of the proposed approach.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
(2021)
Article
Management
Armando Honorio Pereira, Geraldo Robson Mateus, Sebastian Alberto Urrutia
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
Busra Olgun, Cagri Koc, Fulya Altiparmak
Summary: This study addresses the green vehicle routing problem and proposes the HH-ILS algorithm aimed at minimizing fuel consumption and pickup and delivery demands. Comparative analysis reveals that the green objective function has a significant impact on cost, and the HH-ILS algorithm shows competitive results.
COMPUTERS & INDUSTRIAL ENGINEERING
(2021)
Article
Computer Science, Hardware & Architecture
Yogesh Kumar Agarwal, Prahalad Venkateshan
Summary: This article improves the computational time needed to solve difficult symmetric vehicle routing problems by generalizing and generating improved no-good cuts. Results are reported on benchmark instances in literature and new difficult instances generated by the authors. Also, some polyhedral results are presented about the strength of the generalized no-good cuts for a special case of the problem.
Article
Computer Science, Interdisciplinary Applications
Bencomo Dominguez-Martin, Hipolito Hernandez-Perez, Jorge Riera-Ledesma, Inmaculada Rodriguez-Martin
Summary: This paper introduces a new problem that combines characteristics of the Location and Routing Problem and the One-commodity Pickup and Delivery Traveling Salesman Problem. The problem is solved by proposing two mathematical formulations and a branch-and-cut algorithm, and the results show that the algorithm is able to solve instances with up to 100 nodes.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Environmental Sciences
Zeinab Zarrat Dakhely Parast, Hasan Haleh, Soroush Avakh Darestani, Hamzeh Amin-Tahmasbi
Summary: This study introduces a bi-objective mixed-integer linear programming model for designing a green supply chain, which takes into account various factors such as perishable products, vehicle scheduling, and location-inventory-routing problem. Through the use of fuzzy theory, the model is able to minimize total costs and lost demands simultaneously. The results from applying the model in a bread production and distribution industry demonstrate the effectiveness of the proposed solution approach.
ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH
(2021)
Article
Transportation Science & Technology
M. Dell'Amico, R. Montemanni, S. Novellani
Summary: This article studies a pickup and delivery routing problem with time windows in the context of last-mile delivery. Customers can choose between direct home delivery or self-service through lockers. Couriers must deliver parcels and collect return packages on the same route. Returned parcels can be picked up at the customers' homes or at lockers. Customers can choose discounted self-service at nearby lockers or let the logistics company decide. All services must be completed within specified time windows. The article proposes three formulations, two branch-and-cut algorithms, and valid inequalities. It also explores the case of a single vehicle, different types of time windows, and methods for simultaneous pickup and delivery and multiple customer requests.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2023)
Review
Computer Science, Interdisciplinary Applications
Alexander Gutierrez-Sanchez, Linda Bibiana Rocha-Medina
Summary: This paper presents a taxonomic review of Vehicle Routing Problem (VRP) with Time Windows (VRPTW), Pick-up and Delivery Problem (PDP), and Periodic Vehicle Routing Problem (PVRP). The paper focuses on the problems of collection goods and similar. It discusses the applications of these models in the literature and identifies the need for specific research fields related to green and reverse logistics.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Computer Science, Artificial Intelligence
Ece Arzu Yildiz, Ismail Karaoglan, Fulya Altiparmak
Summary: This study focuses on the two-Echelon Location-Routing Problem with Simultaneous Pickup and Delivery (2E-LRPSPD). A Mixed Integer Programming (MIP) formulation is used to solve the problem and a Branch and Cut-based exact algorithm (B & C) is presented. Computational results show that the B & C algorithm provides tight lower and upper bounds and can solve instances with up to 50 customers and 10 satellites in a reasonable time.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Computer Science, Artificial Intelligence
Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-Chi Huang
Summary: This paper addresses the VRPSPDOD problem by proposing a mixed integer linear programming model and a simulated annealing heuristic with a mathematical programming-based construction heuristic. The proposed SA approach achieves comparable results to state-of-the-art algorithms and outperforms the CPLEX solver in terms of solution quality and computational time. Sensitivity analyses are also conducted to gain insights into the impact of various OD parameters on the objective value of VRPSPDOD.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Operations Research & Management Science
Yanwei Zhao, Longlong Leng, Chunmiao Zhang
Summary: This paper introduces a hyper-heuristic approach based on iterated local search to optimize the LRPSPD problem, along with four selection mechanisms and five activation strategies. The study shows that the proposed framework outperforms the classical framework in terms of solution quality and computing time, with different activation strategies having minimal impact on exploiting the best solution, and the FRR-MAB-TS method performing the best among all selection methods.
OPERATIONAL RESEARCH
(2021)
Article
Engineering, Industrial
Pankaj Gupta, Kannan Govindan, Mukesh Kumar Mehlawat, Anisha Khaitan
Summary: Addressing real-life challenges requires proactive measures and steadfast research. In this study, a particular case of Vehicle Routing Problem (VRP) with split deliveries and triangular fuzzy travel times was modelled to minimize fuel emissions. Fuzzy rule-based implication and an expected value model were utilized, and experiments on existing data, parameter tuning, and comparative analysis were conducted to validate the efficacy of the model.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Computer Science, Hardware & Architecture
Faiz Hamid, Yogesh K. Agarwal
Article
Management
Y. K. Agarwal, Prahalad Venkateshan
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2016)
Article
Management
Y. K. Agarwal, Y. P. Aneja
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2017)
Article
Computer Science, Interdisciplinary Applications
Y. K. Agarwal
COMPUTERS & OPERATIONS RESEARCH
(2018)
Article
Management
Ashutosh Nigam, Yogesh K. Agarwal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2014)
Article
Management
Y. K. Agarwal, Prahalad Venkateshan
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2014)
Article
Computer Science, Hardware & Architecture
Yogesh K. Agarwal
Article
Management
Yogesh Agarwal, Yash Aneja
OPERATIONS RESEARCH
(2012)
Article
Management
Yogesh Agarwal
OPERATIONS RESEARCH
(2013)
Article
Computer Science, Hardware & Architecture
Shuvabrata Chakraborty, Yogesh K. Agarwal
Summary: This study explores solutions for the team orienteering problem (TOP) with different types of agents, introducing a Lagrangian relaxation-based method that obtains tight upper and lower bounds simultaneously to measure solution quality. The algorithm achieves an average gap of less than 2% within an average time of around 120 s, demonstrating effectiveness with newly introduced symmetry breaking constraints.
Article
Management
Y. K. Agarwal, Y. P. Aneja, Sachin Jayaswal
Summary: In this study, we propose an efficient cutting-plane based approach to exactly solve a directed fixed charge network design problem. By generating valid inequalities using the polar duality approach and circumventing the challenge of constructing the polar dual, we are able to significantly improve efficiency in solving problem instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Hardware & Architecture
Yogesh Kumar Agarwal, Prahalad Venkateshan
Summary: This article improves the computational time needed to solve difficult symmetric vehicle routing problems by generalizing and generating improved no-good cuts. Results are reported on benchmark instances in literature and new difficult instances generated by the authors. Also, some polyhedral results are presented about the strength of the generalized no-good cuts for a special case of the problem.
Article
Computer Science, Interdisciplinary Applications
Yogesh Kumar Agarwal, Prahalad Venkateshan
INFORMS JOURNAL ON COMPUTING
(2019)
Article
Management
Saurabh Chandra, Rajiv K. Srivastava, Yogesh Agarwal
JOURNAL OF ADVANCES IN MANAGEMENT RESEARCH
(2013)
