Loading...
Please wait, while we are loading the content...
Similar Documents
Modelagem do problema de escalonamento de veículos com múltiplas garagens usando rede tempo-espaço : grandes instâncias e frota heterogênea
| Content Provider | Semantic Scholar |
|---|---|
| Author | Guedes, Pablo Cristini |
| Copyright Year | 2014 |
| Abstract | The multiple-depot vehicle-scheduling problem (MDVSP) is a classic logistic and transportation problem. The MDVSP is also a subproblem for solving various related problems, such as the real time vehicle scheduling problem, disruption management; and integrated problems such as the vehicle and crew scheduling problems. Although several mathematical and solution method have been developed in the literature, large instances (involving thousands of trips and several depots) are still difficult to solve in a reasonable time. The objective of this research work is to verify the applicability of the use of the space-time network towards obtaining good solutions for large instances in short time. Time-space network was suggested by Kliewer et al (2006), and it is positioned with respect to two-dimensional axes, one representing time and the other one space or stations. The arcs represent deadheading movements; and waiting periods in the same station. Solution methods for the MDVS combining time space with integer linear programming solvers and column generation were developed. Extensive testing was carried out using random generated instances, based on demands distribution. Large instances, involving thousands of trips (between 1,000-10,000) and dozen (4-64) depots, are solved in reasonable times. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.lume.ufrgs.br/bitstream/handle/10183/96846/000915445.pdf?isAllowed=y&sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
