A practical heuristic for a large scale vehicle routing problem
Article Abstract:
A heuristic model for the transportation of employees of a government corporation in India is created. Pickup and dropoff points and bus routes are determined by consideringhuman factor constraints, geographical location, accessibility and distance between pickup and dropoff points and the place of work. This vehicle routing problem solution can easily be modified for different environments. Moreover, it can be adapted for use as a personal computer-based decision support system for transportation planning by personnel without knowledge of operations research.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
Postoptimizing equilibrium flows on large scale networks
Article Abstract:
A new postoptimization strategy is presented to take into account perturbations of the traffic demand input that does not need path information. This method does not require a disaggregate decomposition method that functions explicitly on the path flow space. This method is particularly suited to a class of algorithms for the calculation of traffic demand from traffic counts. Application of the method on realistically sized networks indicate a significant decrease in the number of iterations compared to the naive restart method.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Multi-depot vehicle scheduling problems with time windows and waiting costs
Article Abstract:
The multi-depot vehicle scheduling problem with time windows is analyzed. The problem is formulated as an integer nonlinear multi-commodity network flow problem with time variables and solved using a column generation technique embedded in a branch-and-bound algorithm. The costs on exact waiting times between two consecutive tasks are also considered rather than minimal waiting times. It is shown that the approach used yields optimal solutions and outperforms specialized algorithms.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Thatcherism RIP? The lady is for turning: health-service reforms
- Abstracts: An American shield for Asia? Asia's arms race: gearing up. Booming: arms trade
- Abstracts: Process of dominant-cartel formation. Internal cartel stability with time-dependent detection probabilities. Cartel stability and product differentiation
- Abstracts: The architect, the rehab and the planning committee. 'Hollow victory' at Willis Faber. Making room for the movies at Temple Bar
- Abstracts: Roof and windows: office. Trading places. Offices open all hours