Learn More
In this paper we concentrate on Job Shop Scheduling as a representative of constrained combinatorial problems. We introduce a new permutation representation for this problem. Three crossover operators , diierent in tending to preserve the relative order, the absolute order, and the position in the permutation, are deened. By experiment we observe the(More)
In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers' driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a restricted dynamic programming heuristic for the vehicle(More)
A frequently observed diiculty in the application of genetic algorithms to the domain of optimization arises from premature convergence. In order to preserve genotype diversity we develop a new model of auto-adaptive behavior for individuals. In this model a population member is an active individual that assumes social-like behavior patterns. Diierent(More)
The integrated operational transportation planning problem extends the traditional vehicle routing and scheduling problem by the possibility of out-sourcing a part of the requests by involving subcontractors. The purpose of this paper is to present the integrated planning problem and to propose an approach for solving it by a tabu search heuristic. Existing(More)
The paper investigates an online version of the vehicle routing problem with time windows, in which additionally arriving requests cause the revision of so far followed routes and schedules. An extended online optimization framework is proposed, which automatically adapts to problem variations and enables the explicit consideration of up-to-date knowledge(More)