Similar Search Results

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries

Subramanian, A.; Battarra, Maria - In: Journal of the Operational Research Society : OR 64 (2013) 3, pp. 402-409

Persistent link: https://www.econbiz.de/10009726437

An interactive memetic algorithm for production and manufacturing problems modelled as a multi-objective travelling salesman problem

Samanlioglu, Funda; Ferrell, William G.; Kurz, Mary E. - In: International journal of production research 50 (2012) 20, pp. 5671-5682

Persistent link: https://www.econbiz.de/10009670453

The asymmetric bottleneck traveling salesman problem : algorithms, complexity and empirical analysis

LaRusic, John; Punnen, Abraham P. - In: Computers & operations research : and their … 43 (2014), pp. 20-35

Persistent link: https://www.econbiz.de/10010241299

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

Cheang, Brenda; Gao, Xiang; Lim, Andrew; Qin, Hu; Zhu, … - In: European journal of operational research : EJOR 223 (2012) 1, pp. 60-75

Persistent link: https://www.econbiz.de/10009614028

A coevolutionary algorithm for the flexible delivery and pickup problem with time windows

Wang, Hsiao-fan; Chen, Ying-yen - In: International journal of production economics 141 (2013) 1, pp. 4-13

Persistent link: https://www.econbiz.de/10009685720

A Quick Heuristic Algorithm for Travelling Salesman Problem

Mastan, Shaik - 2019

The Optimization of a large-scales travelling salesman Problem (TSP) mostly in telecommunication networks that may be a well-known NP-hard downside in combinatorial improvement, may be a long downside. During this paper, the planned heuristic algorithmic program is intended for quick parameter,...

Persistent link: https://www.econbiz.de/10012858320