Ara
Toplam kayıt 7, listelenen: 1-7
Traveling Repairmen Problem: A Biogeography-Based Optimization
(2022)
Traveling Repairman Problem (TRP), which is also known by names cumulative traveling salesman problem, the deliveryman problem and the minimum latency problem, is a special variant of Traveling Salesman Problem (TSP). In ...
New integer programming formulation for multiple traveling repairmen problem
(2017)
The multiple traveling repairman problem (kTRP) is a generalization of the traveling repairman problem which is also known as the minimum latency problem and the deliveryman problem. In these problems, waiting time or ...
New Formulations for the Orienteering Problem
(2016)
Problems associated with determining optimal routes from one or several depots (origin, home city) to a set of nodes (vertices, cities, customers, locations) are known as routing problems. The Traveling Salesman Problem ...
Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows
(2015)
Traveling Salesman Problem with Time Windows (TSPTW) serves as one of the most important variants of the Traveling Salesman Problem (TSP). The main objective functions expressed in the literature of the TSPTW consist of ...
New formulations for multiple traveler minimum latency problem with time windows
(2022)
In this paper, new mathematical models for homogeneous and heterogeneous multiple traveler minimum latency problem with time windows (kLPTW), named as M2 and M4 are developed. These models are computationally compared with ...
A Mathematical Formulation And Heuristic Approach For The Heterogeneous Fixed Fleet Vehicle Routing Problem With Simultaneous Pickup And Delivery
(2021)
This study considers a variant of the vehicle routing problem (VRP) called the heterogeneous VRP with simultaneous pickup and delivery (HVRPSPD). The HVRPSPD may broadly be defined as identifying the minimum cost routes ...