Similar Search Results

Yüceer, Ümit - In: Journal of industrial engineering international 9 (2013), pp. 1-9

solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the … knapsack solution. It requires testing and matching too many alternatives to obtain a partition. The sweep algorithm is …

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

Yet another bidirectional algorithm for shortest paths

Pijls, Wim; Post, Henk - 2009

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

A comprehensive survey on the generalized traveling salesman problem

Pop, Petrică C.; Cosma, Ovidiu; Sabo, Cosmin; Sitar, … - In: European journal of operational research : EJOR 314 (2024) 3, pp. 819-835

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

The family capacitated vehicle routing problem

Bernardino, Raquel; Paias, Ana - In: European journal of operational research : EJOR 314 (2024) 3, pp. 836-853

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

An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem

Heidari, Nooshin; Hemmati, Ahmad - In: Computational management science 20 (2023) 1, pp. 1-23

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

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

Flow Shop Arrangement of Heuristics-Palmer, Campbell Dude Smith Algorithm : Effective Tools to Mitigate the Travelling Salesman Problem

Mastan, Shaik - 2019

The briefest pathway issue is characterized an issue in diagram hypothesis. It is tied in with finding another way. The pair of least vertices is framed least length. For assume any system the heaviness of each edge. It is generally spoken to in a type of fresh genuine number. To consequently...

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

Competition with Multi-Services : Pickup or Delivery?

Yasui, Yuta - 2017

In this paper, I examine duopoly with multi-services, where firms offer delivery prices and mill prices at the same time, and each consumer chooses one of them. In the equilibria, firms specialize in delivery services even if their transport costs are higher than consumers'. This result is...

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

Exact Algorithms for the Equitable Traveling Salesman Problem

Kinable, Joris - 2016

Given a weighted graph G = (V, E), the Equitable Traveling Salesman Problem (ETSP) asks for two perfect matchings in G such that (1) the two matchings together form a Hamiltonian cycle in G and (2) the absolute difference in costs between the two matchings is minimized. The problem is shown to...

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

Model of using the exhaustive search algorithm in solving of Traveling Salesman Problem (TSP) on The example of the transport network optimization of Primorje-Gorski Kotar County (...

Vukmirović, Slavomir; Čapko, Zvonko; Babic, Ana - In: Embracing diversity in organisations : 7th …, (pp. 391-401). 2019

This paper considers and presents a model of the use of an exhaustive search algorithm in solving problems of a … methods of modeling and programming in the design of the exhaustive search algorithm in the spreadsheet interface, enable … exhaustive search algorithm. In the example are also defined nodes that are common to both the two sets and that are connecting …

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