Results 71 to 80 of about 877 (188)

A path‐based two‐commodity flow model and a branch‐price‐and‐cut algorithm for the inventory routing problem with time windows

International Transactions in Operational Research, EarlyView.
Abstract We study an inventory routing problem with time windows (IRPTW). A single supplier serves a set of customers to fulfill their demand throughout a planning horizon. Each customer can be visited only within designated time windows, assuming each customer provides a single delivery time window valid for all periods.
Sara Charaf, Guy Desaulniers, Frédéric Quesnel, Duygu Taş, Simme Douwe P. Flapper, Tom Van Woensel   +5 more
wiley   +1 more source

Keep on Keepin’ on Down Under: Administrative Heritage and the Strategic Realignment of Multinational Enterprises in Australia During Deglobalization, 1914–79

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, André Sammartino, Simon Ville, David Merrett, Monica Keneley   +4 more
wiley   +1 more source

Optimizing Path of The Travelling Salesman Problem Through Modified Genetic Algorithms

NTU Journal of Pure Sciences
The Traveling Salesman Problem (TSP) stands as one of the earliest and most pervasive optimization challenges, aiming to streamline the salesman's travel route, ensuring efficiency and avoiding redundancy. With an extensive number of cities to visit and
Osama Hassani
doaj   +1 more source

Coordination of Pheromone Deposition Might Solve Time-Constrained Travelling Salesman Problem

Complexity, 2018
In this study, we develop two Ant Colony Optimization (ACO) models as new metaheuristic models for solving the time-constrained Travelling Salesman Problem (TSP).
Tomoko Sakiyama, Ikuo Arizono
doaj   +1 more source

A Contribution to the “Travelling-Salesman” Problem

Journal of the Royal Statistical Society Series B: Statistical Methodology, 1955
Summary This paper is concerned with finding the shortest closed path joining n points where the distances between all pairs of points are given. For a set of points in a metric space we establish that the shortest path will consist of a single loop circuit that will never cross itself.
Morton, G., Land, A. H.
openaire   +2 more sources

The Railway Traveling Salesman Problem [PDF]

, 2007
We consider theRailwayTraveling SalesmanProblem(RTSP) in which a salesman using the railway network wishes to visit a certain number of cities to carry out his/her business, starting and ending at the same city, and having as goal to minimize the overall time of the journey. RTSP is an NP-hard problem.
Georgia Hadjicharalambous, Petrica C. Pop, Evangelia Pyrga, George Tsaggouris, Christos D. Zaroliagis   +4 more
openaire   +1 more source

Analisis Hibridisasi Pencarian Lokal Dengan Populasi Dalam Travelling Salesman Problem (TSP)

Jurnal Serambi Engineering, 2018
Traveling Salesman Problem (TSP) merupakan sebuah permasalah optimasi yang dapat diterapkan pada berbagai kegiatan seperti pendistribusian barang, pengambilan tagihan listirk dan pedagang keliling.
Erdiwansyah Erdiwansyah*, Yeni yanti, Munawir Munawir, Raihan Islamadina   +3 more
doaj   +1 more source

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source

Complexity indices for the travelling salesman problem and data mining [PDF]

Transactions on Combinatorics, 2012
In this survey paper we extend our previous work on complexity indices for the travelling salesman problem (TSP), summarized in cite{CvCK3}, using graph spectral techniques of data mining. A complexity index is an invariant of an instance $I$ by which we
Dragos Cvetković
doaj  

Ensuring connectedness for the maximum quasi‐clique and densest k‐subgraph problems

International Transactions in Operational Research, Volume 33, Issue 6, Page 3800-3824, November 2026.
Abstract Given an undirected graph G$G$, a quasi‐clique is a subgraph of G$G$ with density at least γ$\gamma$ (0<γ≤1)$(0 < \gamma \le 1)$. Two optimisation problems can be defined for quasi‐cliques: the maximum quasi‐clique (MQC) problem, which finds a quasi‐clique with maximum vertex cardinality, and the densest k$k$‐subgraph (DKS) problem, which ...
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete   +3 more
wiley   +1 more source