Krstev, Dejan and Polenakovik, Radmil and Golomeova, Mirjana (2014) Vehicle routing and scheduling – The traveling salesman problem. Mechanical Engineering – Scientific Journal, Proceedings, 32 (1). pp. 109-117. ISSN 1857 – 5293
Preview |
Text
Mech. Eng. sci. J.-32-1-2014-PDF.pdf Download (3MB) | Preview |
Abstract
The classification of routing and scheduling problems depends on certain characteristics of the
service delivery system, such as size of the delivery fleet, where the fleet is housed, capacities of the vehicles, and routing and scheduling objectives. In the simplest case, we begin with a set of nodes to be visited by a single vehicle. The nodes may be visited in any order, there are no precedence relationships, the travel costs between two nodes are the same regardless of the direction traveled, and there are no delivery-time restrictions. In addition, vehicle capacity
is not considered. The output for the single-vehicle problem is a route or a tour where each node is visited only once and the route begins and ends at the depot node. The tour is formed with the goal of minimizing the total tour cost. This simplest case is referred to as a traveling salesman problem (TSP). An extension of the traveling salesman problem, referred to as the multiple traveling salesman problems (MTSP), occurs when a fleet of vehicles must be routed from a single depot. The goal is to generate a set of routes, one for each vehicle in the fleet.
| Item Type: | Article |
|---|---|
| Subjects: | Engineering and Technology > Other engineering and technologies |
| Divisions: | Faculty of Natural and Technical Sciences |
| Depositing User: | Afrodita Zendelska |
| Date Deposited: | 11 Aug 2014 12:54 |
| Last Modified: | 11 Aug 2014 12:54 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/10566 |
Actions (login required)
 |
View Item |