4.7 Article

Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems

相关参考文献

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

An exact algorithm for the two-echelon vehicle routing problem with drones

Hang Zhou et al.

Summary: This study focuses on a new variant of the vehicle routing problem with drones, the two-echelon vehicle routing problem with drones, where multiple vehicles and drones collaborate to serve customers. The study considers practical constraints such as delivery deadlines and energy capacity of drones. Unlike previous research, the number of drones taken by each vehicle is treated as a decision variable, providing flexibility in planning vehicle and drone routes. The study proposes a mixed-integer linear programming model and an exact branch-and-price algorithm to solve the problem efficiently, and the results demonstrate the effectiveness of the algorithm in optimizing routes and the potential for further improvements.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2023)

Review Computer Science, Interdisciplinary Applications

A systematic literature review of the vehicle routing problem in reverse logistics operations

Kubra Sar et al.

Summary: The increasing rate of global consumption has resulted in a surge of waste, causing environmental concerns but also offering economic opportunities. Governments advocate for the collection and recycling of this waste, despite logistical challenges such as carbon emissions and transportation expenses. This paper conducts a literature review of 109 published articles between 2000 and 2022 on the vehicle routing problem in reverse logistics, addressing modeling approaches, solution techniques, problem variants, sustainability, waste types, and future research opportunities. The review highlights important findings and discussions.

COMPUTERS & INDUSTRIAL ENGINEERING (2023)

Article Management

Memetic search for the minmax multiple traveling salesman problem with single and multiple depots

Pengfei He et al.

Summary: This article presents a unified algorithm to solve the minmax multiple traveling salesman problem with single or multiple depots. The algorithm uses crossover operation to generate new solutions, variable neighborhood descent for local optimization, and post-optimization for further improvement. Experimental results show that the algorithm performs well compared to other leading algorithms.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article

Analysis of multi-objective vehicle routing problem with flexible time windows: The implication for open innovation dynamics

Kasin Ransikarbum et al.

Journal of Open Innovation: Technology, Market, and Complexity (2023)

Article Computer Science, Interdisciplinary Applications

Hybrid search with neighborhood reduction for the multiple traveling salesman problem

Pengfei He et al.

Summary: The paper presents a hybrid algorithm for solving the multiple traveling salesman problem, combining different optimization strategies to achieve good results.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Computer Science, Interdisciplinary Applications

An effective iterated two-stage heuristic algorithm for the multiple Traveling Salesmen Problem

Jiongzhi Zheng et al.

Summary: In this paper, we propose an iterated two-stage heuristic algorithm called ITSHA to solve the multiple Traveling Salesmen Problem (mTSP). Experimental results show that ITSHA algorithm performs significantly better than the state-of-the-art heuristic algorithms in solving the mTSP with both the minsum objective and minmax objective.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Computer Science, Information Systems

A Two-Index Formulation for the Fixed-Destination Multi-Depot Asymmetric Travelling Salesman Problem and Some Extensions

Maichel M. Aguayo et al.

Summary: The study introduces a compact formulation for solving the fixed-destination multi-depot asymmetric traveling salesman problem, utilizing the multi-depot aspect for modeling and successfully addressing two important extensions.

INFORMATICA (2022)

Article Computer Science, Theory & Methods

Hybrid genetic algorithm with variable neighborhood search for multi-scale multiple bottleneck traveling salesmen problem

Xueshi Dong et al.

Summary: The paper proposes an optimization model named multiple bottleneck traveling salesmen problem (MBTSP) and investigates multi-scale MBTSP and its solving algorithms, introducing a novel hybrid genetic algorithm (VNSGA) which demonstrates better performance than state-of-the-art algorithms.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2021)

Review Green & Sustainable Science & Technology

The green vehicle routing problem: A systematic literature review

Reza Moghdani et al.

Summary: In recent decades, optimization packages have been increasingly utilized for efficient management of distribution systems, resulting in significant savings in global transportation costs. The emerging research field of green vehicle routing problem (GVRP) draws attention from many researchers. Findings suggest that researches on GVRPs are relatively new and there is room for significant improvements in various areas.

JOURNAL OF CLEANER PRODUCTION (2021)

Article Computer Science, Interdisciplinary Applications

Modeling and optimization of multiple traveling salesmen problems: An evolution strategy approach

Korhan Karabulut et al.

Summary: The paper proposes an evolution strategy approach for solving the mTSP with minsum and minmax objectives, using a self-adaptive Ruin and Recreate heuristic to generate offspring population. The strategy combines various heuristic methods and local search algorithms, achieving competitive results.

COMPUTERS & OPERATIONS RESEARCH (2021)

Article Computer Science, Hardware & Architecture

A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem

Yan Zhang et al.

Summary: This study introduces an intelligent algorithm for solving the multiple traveling salesman problem using metropolitan criteria and basic matrix operations to generate the solution space, while enhancing the ability to capture the global optimal solution by introducing the 2opt neighborhood search structure. Experimental results demonstrate the superior performance of this method in MTSP.

JOURNAL OF SUPERCOMPUTING (2021)

Review Computer Science, Information Systems

A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy

Omar Cheikhrouhou et al.

Summary: The Multiple Traveling Salesman Problem (MTSP) is a widely applied combinatorial optimization problem in real-life applications such as robotics, transportation, and networking. This paper aims to provide a comprehensive review of existing studies on MTSP, focusing on its solutions and application domains, as well as proposing a taxonomy and classification for recent research.

COMPUTER SCIENCE REVIEW (2021)

Article Operations Research & Management Science

An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint

Purusotham Singamsetty et al.

Summary: The paper addresses an open multiple travelling salesman problem with load balancing constraint (OMTSPLB) and proposes a zero-one integer linear programming model and an efficient metaheuristic genetic algorithm (GA) to tackle the problem. Experimental results demonstrate the effectiveness of the proposed GA in finding global solutions for OMTSPLB.

DECISION SCIENCE LETTERS (2021)

Article Computer Science, Artificial Intelligence

A new efficient hybrid algorithm for large scale multiple traveling salesman problems

Chao Jiang et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Operations Research & Management Science

Vehicle routing problems over time: a survey

A. Mor et al.

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH (2020)

Article Computer Science, Artificial Intelligence

Accelerating the Miller-Tucker-Zemlin model for the asymmetric traveling salesman problem

Giovanni Campuzano et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Article Computer Science, Artificial Intelligence

A reinforcement learning approach for optimizing multiple traveling salesman problems over graphs

Yujiao Hu et al.

KNOWLEDGE-BASED SYSTEMS (2020)

Proceedings Paper Automation & Control Systems

Market Approach to Length Constrained Min-Max Multiple Depot Multiple Traveling Salesman Problem

Drew Scott et al.

2020 AMERICAN CONTROL CONFERENCE (ACC) (2020)

Article Construction & Building Technology

Generalized task allocation and route planning for robots with multiple depots in indoor building environments

Bharadwaj R. K. Mantha et al.

AUTOMATION IN CONSTRUCTION (2020)

Proceedings Paper Computer Science, Theory & Methods

Solving Multiple Traveling Salesmen Problem using Discrete Pigeon Inspired Optimizer

Hadeel Alazzam et al.

2020 11TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION SYSTEMS (ICICS) (2020)

Article Computer Science, Artificial Intelligence

Mission-oriented ant-team ACO for min-max MTSP

Li-Chih Lu et al.

APPLIED SOFT COMPUTING (2019)

Article Computer Science, Interdisciplinary Applications

Multiple traveling salesman problem with drones: Mathematical model and heuristic approach

Patchara Kitjacharoenchai et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2019)

Article Computer Science, Artificial Intelligence

Two phase heuristic algorithm for the multiple-travelling salesman problem

Xiaolong Xu et al.

SOFT COMPUTING (2018)

Article Computer Science, Artificial Intelligence

A comparative study of improved GA and PSO in solving multiple traveling salesmen problem

Honglu Zhou et al.

APPLIED SOFT COMPUTING (2018)

Article Computer Science, Artificial Intelligence

A Genetic Algorithm with New Local Operators for Multiple Traveling Salesman Problems

Kin-Ming Lo et al.

International Journal of Computational Intelligence Systems (2018)

Article Computer Science, Artificial Intelligence

A modified two-part wolf pack search algorithm for the multiple traveling salesmen problem

Yongbo Chen et al.

APPLIED SOFT COMPUTING (2017)

Article Computer Science, Interdisciplinary Applications

Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem

Yongzhen Wang et al.

COMPUTERS & INDUSTRIAL ENGINEERING (2017)

Article Computer Science, Artificial Intelligence

Two metaheuristic approaches for the multiple traveling salesperson problem

Pandiri Venkatesh et al.

APPLIED SOFT COMPUTING (2015)

Article Computer Science, Interdisciplinary Applications

A general variable neighborhood search heuristic for multiple traveling salesmen problem

Banu Soylu

COMPUTERS & INDUSTRIAL ENGINEERING (2015)

Proceedings Paper Computer Science, Artificial Intelligence

Performance Evaluation of Ant Colony Systems for the Single-Depot Multiple Traveling Salesman Problem

Raluca Necula et al.

HYBRID ARTIFICIAL INTELLIGENT SYSTEMS (HAIS 2015) (2015)

Article Computer Science, Interdisciplinary Applications

Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations

Subhash C. Sarin et al.

COMPUTERS & OPERATIONS RESEARCH (2014)

Article Operations Research & Management Science

Multi-depot Multiple TSP: a polyhedral study and computational results

Enrique Benavent et al.

ANNALS OF OPERATIONS RESEARCH (2013)

Article Management

Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree

Liang Xu et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)

Article Management

A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms

Shuai Yuan et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)

Article Computer Science, Artificial Intelligence

A Market-based Solution to the Multiple Traveling Salesmen Problem

Elad Kivelevitch et al.

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS (2013)

Article Multidisciplinary Sciences

A novel method for solving the multiple traveling salesmen problem with multiple depots

Hou MengShu et al.

CHINESE SCIENCE BULLETIN (2012)

Article Computer Science, Artificial Intelligence

An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems

Soheil Ghafurian et al.

APPLIED SOFT COMPUTING (2011)

Article Operations Research & Management Science

An analysis of the extended Christofides heuristic for the k-depot TSP

Zhou Xu et al.

OPERATIONS RESEARCH LETTERS (2011)

Article Mathematics, Applied

A Lagrangian-based algorithm for a Multiple Depot, Multiple Traveling Salesmen Problem

S. Yadlapalli et al.

NONLINEAR ANALYSIS-REAL WORLD APPLICATIONS (2009)

Article Computer Science, Artificial Intelligence

A new grouping genetic algorithm approach to the multiple traveling salesperson problem

Alok Singh et al.

SOFT COMPUTING (2009)

Article Computer Science, Artificial Intelligence

A grouping genetic algorithm for the multiple traveling salesperson problem

Evelyn C. Brown et al.

INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING (2007)

Article Mathematics, Interdisciplinary Applications

A columnar competitive model for solving multi-traveling salesman problem

Hong Qu et al.

CHAOS SOLITONS & FRACTALS (2007)

Article Management

A new approach to solving the multiple traveling salesperson problem using genetic algorithms

Arthur E. Carter et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)

Article Management

Integer linear programming formulations of multiple salesman problems and its variations

Imdat Kara et al.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)

Article Management

The multiple traveling salesman problem: an overview of formulations and solution procedures

T Bektas

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2006)

Article Mathematics, Applied

A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree

H Nagamochi et al.

DISCRETE APPLIED MATHEMATICS (2004)