Ara
Toplam kayıt 8, listelenen: 1-8
The Location-Routing Problem with Simultaneous Pickup and Delivery: Formulations and A Heuristic Approach
(2012)
In this paper, we consider a variant of the Location-Routing Problem (LRP), namely the LRP with simultaneous pickup and delivery (LRPSPD). The LRPSPD seeks to minimize total cost by simultaneously locating the depots and ...
New Integer Linear Programming Formulation for the Traveling Salesman Problem with Time Windows: Minimizing Tour Duration with Waiting Times
(2013)
The travelling salesman problem, being one of the most attractive and well-studied combinatorial optimization problems, has many variants, one of which is called travelling salesman problem with Time Windows (TSPTW)'. In ...
An Integrated Fuzzy TOPSIS-Knapsack Problem Model for Order Selection in a Bakery
(2017)
In this study, a new model has been developed for the order selection problem for a bakery firm located in Turkey. We consider a combined order selection and process planning problem where a make-to-order bakery goods ...
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 ...
Heterogeneous Vehicle Routing Problem with Simultaneous Pickup and Delivery: Mathematical Formulations and A Heuristic Algorithm
(2015)
One of the most important operational decisions in the logistics management is to determine the vehicle routes serving the customers. The Vehicle Routing Problem (VRP) can be defined as the determination of the optimal ...