Results 61 to 70 of about 5,636,127 (168)
The 2-period balanced traveling salesman problem [PDF]
In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core
GCN-Pointransformer Model for Solving Traveling Salesman Problem [PDF]
Jisuanji kexue yu tansuoBecause the Transformer model is based on the fully connected attention mechanism, the computational complexity is high and the GPU memory usage is too large when solving the classic traveling salesman problem (TSP).
QIU Yunfei, LIU Yifei, YU Zhilong, JIN Haibo
doaj +1 more source
The one‐dimensional cutting stock problem with sequence‐dependent setups
International Transactions in Operational Research, EarlyView.Abstract The cutting stock problem (CSP) is a classic operations research problem with several applications in real‐world scenarios. It involves cutting large objects into smaller items to satisfy customer demands, minimizing the number of cut objects.
Eduardo M. Silva +3 more
wiley +1 more source
On the Core of Multiple Longest Traveling Salesman Games [PDF]
In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward ...
Borm, P.E.M. +2 more
core
Journal of Management Studies, EarlyView.Abstract We analyse the behaviour of multinational enterprises (MNEs) within a host nation – Australia – during deglobalization (1914–79). Deglobalization is often portrayed as a drastic event to which MNEs respond swiftly, probably through withdrawal from host countries.
Pierre Van der Eng +4 more
wiley +1 more source
Iterative Patching and the Asymmetric Traveling Salesman Problem [PDF]
Although Branch and Bound (BnB) methods are among the most widely used techniques for solving hard problems, it is still a challenge to make these methods smarter.
Goldengorin, Boris +3 more
core
How to make a greedy heuristic for the asymmetric traveling salesman problem competitive [PDF]
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP.
Jäger, G., Goldengorin, B.
core
, 2016 Travelling Salesman Problem (TSP) is one of the most researched combinatorial problems in mathematics. This chapter incorporates chaotic maps in evolutionary algorithms as random number generators and applies it to the TSP.
Zelinka, Ivan +3 more
core +1 more source
The Australian Journal of Anthropology, EarlyView.Abstract This article draws on the narratives of Mongolians who have worked in Korea to explore the experience of migrant labour and the role work abroad plays in Mongolian identities and life projects. Four different categories of worker are discussed: those working on 3 month visas; those working illegally having overstayed their visa; contract ...
P. Chuluunbat, Richard D. G. Irvine
wiley +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source