2,068 Hits in 6.1 sec

An efficient hybrid genetic algorithm for solving truncated travelling salesman problem

S. Purusotham, T. Jayanth Kumar, T. Vimala, K.J. Ghanshyam
2022 Decision Science Letters  
as in conventional travelling salesman problem (TSP)) with minimal traversal distance.  ...  This paper considers a practical truncated traveling salesman problem (TTSP), in which the salesman is only required to cover a subset of out of given cities (rather than covering all the given cities  ...  Thus, exact algorithms will not work for higher dimensional problems and it is inevitable to develop an efficient heuristic or metaheuristic algorithm.  ... 
doi:10.5267/j.dsl.2022.6.003 fatcat:b5btlnooevflfnyjkpvwqneude

Online FDS

Surwase Aishwarya, Tambe Prasad, Salave Tushar, Shinde Mayur
2019 Zenodo  
The online food delivery system is one of the fastest growing marketing strategies for food and hotel industries to gain more profits.  ...  FDS have a multi-vendor system with user friendly dashboard. FDS has the most famous vendors in the city and a wide variety of food items. A user can order his/her favorite food following easy steps.  ...  ACKNOWLEDGEMENT Authors of this paper are very thankful to AMI Pvt Ltd for sponsoring the research presented in this paper. We like to express our thanks to  ... 
doi:10.5281/zenodo.2656304 fatcat:hjs4ijrvhjhczc3fxrot3xh5ye

A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles

Ines Khoufi, Anis Laouiti, Cedric Adjih
2019 Drones  
These are related to the two existing general classic ones—the Traveling Salesman Problem and the Vehicle Routing Problem.  ...  We analyze the recent literature that adapted the problems to the UAV context, provide an extensive classification and taxonomy of their problems and their formulation and also give a synthetic overview  ...  Delivery by n-Trucks and m-Drones The multiple Traveling Salesman Problem with Drones (mTSPD) is an extended variant of the Multiple Traveling Salesman Problem (mTSP) with the implementation of drones  ... 
doi:10.3390/drones3030066 fatcat:xzvuhjuwkva45fmgmjbk3b4osm

Page 283 of The Journal of the Operational Research Society Vol. 43, Issue 3 [page]

1992 The Journal of the Operational Research Society  
MILLER (1989) An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline. Working paper. . A. A. KUEHN and M. J.  ...  ToTH (1988) An additive approach for the optimal solution of the prize-collecting travelling salesman problem. In Vehicle Routing: Methods and Studies (B. L. GOLDEN and A. A.  ... 

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

Omar Cheikhrouhou, Ines Khoufi
2021 Computer Science Review  
The Multiple Travelling Salesman Problem (MTSP) is among the most interesting combinatorial optimization problems because it is widely adopted in real-life applications, including robotics, transportation  ...  We highlight the approaches applied to solve the MTSP as well as its application domains. We analyze the MTSP variants and propose a taxonomy and a classification of recent studies.  ...  The FCMURP is a generalization of the multiple traveling salesman problem and a variant of the vehicle routing problem for UAVs with fuel constraints.  ... 
doi:10.1016/j.cosrev.2021.100369 fatcat:xnpxosxsdfbb5i6zm5ajlbx4fu

An annotated bibliography of combined routing and loading problems

Manuel Iori, Silvano Martello
2013 Yugoslav Journal of Operations Research  
This annotated bibliography aims at collecting, in a systematic way, the most relevant results obtained in the area of vehicle routing with loading constraints, with the objective of stimulating further  ...  Transportation problems involving routing and loading at the same time are currently a hot topic in combinatorial optimization.  ...  A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks, 60:212-226, 2012. M. Battarra, G. Erdoğan, G. Laporte, and D. Vigo.  ... 
doi:10.2298/yjor130315032i fatcat:nmrsizitqnf2lkrl2772w7icxe

Clarke & Wright's Savings Algorithm and Genetic Algorithms Based Hybrid Approach for Flying Sidekick Traveling Salesman Problem

Büşra Özoğlu, Emre Çakmak, Tuğçe Koç
2019 European Journal of Science and Technology  
This paper investigates a new version of traveling salesman problem called as flying sidekick traveling salesman problem(FSTSP) in which trucks and drones serve the customers in coordination with the objective  ...  In this paper, a hybrid approach based on Clarke & Wright's savings algorithm and genetic algorithm is proposed for solving the new version of travelling salesman problem.  ...  for flying sidekick traveling salesman problem.  ... 
doi:10.31590/ejosat.637816 fatcat:mk7t5q6gwnawrdlrh6hwihuucq

Description of the classification of publications and the models used in solving of the vehicle routing problem with pickup and delivery

Pedro Pablo Ballesteros Silva, Antonio Hernando Escobar Zuluaga
2016 Revista Ingenierías Universidad de Medellín  
Key words: complexity of the problem, mathematical programming, methods of solution, modeling tools, vehicle routing problem with delivery and pickups, future trends and treatment of the problem.  ...  This review paper presents the description of the state of the art of the vehicle routing problem with pickups and deliveries, vrppd, product obtained from the literature review of most of the models reported  ...  This problem is identical to the traveling salesman with mixed deliveries and pickups. The scenarios in which this problem can be analyzed by Berbeglia et al.  ... 
doi:10.22395/rium.v15n28a14 fatcat:vc4ndx3mtja2ffv4ip5neq4ypq

Combinatorial optimization and vehicle fleet planning: Perspectives and prospects

T. L. Magnanti
1981 Networks  
ACKNOWLEDGEMENTS I am grateful to Bruce Golden, Steve Graves, Jan Hammond, and Paul Mireault for their comments on an earlier version of this paper.  ...  In fact, it would not be surprising to find that the gap between algorithmic capabilities for the traveling salesman problem and for other vehicle fleet planning problems will narrow, and that exact methods  ...  vehicle routing problems would evolve and progress as dramatically as algorithms for the traveling salesman problem.  ... 
doi:10.1002/net.3230110209 fatcat:kmmvt63wbjcppep5ak6zvhc7em

A Hybrid Optimization Algorithm for Traveling Salesman Problem Based on Geographical Information System for Logistics Distribution

Wei Gu, Yong Liu, Li-Rong Wei, Bing-Kun Dong
2015 International Journal of Grid and Distributed Computing  
This paper presents a hybrid algorithm for traveling salesman problem.  ...  The algorithm has tested on the examples of international standards. We made a comparison with the result of second nearest neighbor algorithm and genetic optimization algorithm.  ...  for traveling salesman problem (TSP).  ... 
doi:10.14257/ijgdc.2015.8.3.33 fatcat:d3ymu5vxwrebrgzmg2lz6up4nq

Page 3057 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
Bramel, Julien (1-CLMB-BA; New York, NY) Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries.  ...  Summary: “We consider the capacitated traveling salesman prob- lem with pickups and deliveries. This problem is characterized by a set of n pickup points and a set of n delivery points.  ... 

Page 264 of The Journal of the Operational Research Society Vol. 51, Issue 3 [page]

2000 The Journal of the Operational Research Society  
Their article introduces several formulations for the traveling salesman problem: (1) m-traveling salesman problem; (2) vehicle routing problem; and (3) multi-depot vehicle routing problem.  ...  We can actually break up demand from the same bay for different required time with the database so that we can choose to collect or not, again with the use of a dummy routes are  ... 

Page 908 of The Journal of the Operational Research Society Vol. 54, Issue 8 [page]

2003 The Journal of the Operational Research Society  
The procedure is based on the Christo- fides> approximation algorithm for the traveling salesman problem (TSP) and has a worst-case performance ratio of 3 2. Finally, Corberan et al?  ...  have developed an exact branch- and-cut algorithm for the undirected GRP. The largest instance solved to optimality using this approach contains 200 vertices.  ... 


Vitoria Pureza, Reinaldo Morabito, Henrique P. Luna
2018 Pesquisa Operacional  
This paper addresses the Traveling Salesman Problem with Priority Prizes (TSPPP), an extension of the classical TSP in which the order of the node visits is taken into account in the objective function  ...  The problem can be seen as a TSP variant with a more general objective function, aiming at solutions that in some way consider the quality of customer service and the delivery priorities and costs.  ...  ACKNOWLEDGEMENTS The authors would like to thank the two reviewers for their useful comments and suggestions of revision, and CNPq and FAPESP for the financial support.  ... 
doi:10.1590/0101-7438.2018.038.03.0499 fatcat:yv2gptcmtnazdcxvvpbwijhkmi

Page 580 of The Journal of the Operational Research Society Vol. 57, Issue 5 [page]

2006 The Journal of the Operational Research Society  
Mingozzi et al (1999) presented an algorithm for the exact solution based on a new integer formulation.  ...  The clusters are combined by solving an auxiliary assignment problem and the initial routes are built through a modified traveling salesman problem heuristic.  ... 
« Previous Showing results 1 — 15 out of 2,068 results