Herbert Kopfer

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)
The application of adaptive optimization strategies to scheduling in manufacturing systems has recently become a research topic of broad interest. Population based approaches to scheduling predominantly treat static data models, whereas real-world scheduling tends to be a dynamic problem. This paper brieey outlines the application of a genetic algorithm to(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 dynamic programming approach for the vehicle routing(More)
A truck scheduling problem for container transportation in a local area with multiple depots and multiple terminals including containers as a resource for transportation is addressed. Four types of movements of containers as inbound full, outbound full, inbound empty and outbound empty movements as well as the time windows at both the origin and the(More)
The Inland Container Transportation Problem describes the movement of full and empty containers among a number of terminals, depots and customers in a hinterland region. A trucking company with a homogeneous fleet of trucks has to serve customers which either receive goods by inbound containers or ship goods by outbound containers. While keeping given hard(More)
The paper presents a model for the collaboration among independent freight forwarding entities. In the modern highly competitive transportation branch freight forwarders reduce their fulfillment costs by exploiting different execution modes (self-fulfillment and subcontraction). For self-fulfillment they use their own vehicles to execute the requests and(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)
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)