Showing 1 - 10 of 23
For several decades research on intelligent techniques for decision-making has represented a particular challenge, originally taken up using modest hardware equipment, which we today would consider to be extremely weak. From earliest times onwards research which was concerned with the theory and...
Persistent link: https://www.econbiz.de/10013521010
Über die westeuropäischen Seehafen-Automobilterminals wird seit einigen Jahren ein Großteil der europäischen Fahrzeugimporte abgewickelt. Moderne computergestützte Planungssysteme können einen signifikanten Beitrag zu der dringend notwendigen Erschließung von Rationalisierungs- und...
Persistent link: https://www.econbiz.de/10013509076
In der betrieblichen Planung müssen häufig komplexe kombinatorische Optimierungsprobleme wie das Standardproblem der Tourenplanung mit Zeitfensterrestriktionen in akzeptablen Rechenzeiten gelöst werden. Hierzu haben sich Metaheuristiken etabliert. In jüngerer Zeit erhofft man sich eine...
Persistent link: https://www.econbiz.de/10013517542
Persistent link: https://www.econbiz.de/10011740524
Purpose – To propose and to evaluate a new genetic algorithm (GA) for solving the dynamic pickup and delivery problem with time windows (DPDPTW). Design/methodology/approach – First, a grouping genetic algorithm (GGA) for the (static) PDPTW is described. In order to solve the dynamic...
Persistent link: https://www.econbiz.de/10014793595
Moderne computergestützte Informationssysteme zur Transportdisposition können einen signifikanten Beitrag zur dringend notwendigen Erschließung von Rationalisierungspotenzialen im Transportgewerbe leisten. Giselher Pankratz präsentiert ein Modell eines speditionellen Dispositionsproblems,...
Persistent link: https://www.econbiz.de/10013510269
In this paper, we extend the vehicle routing problem with clustered backhauls (VRPCB) to an integrated routing and three-dimensional loading problem, called VRPCB with 3D loading constraints (3L-VRPCB). In the VRPCB each customer is either a linehaul or a backhaul customer and in each route all...
Persistent link: https://www.econbiz.de/10011190753
In the container pre-marshalling problem (CPMP) n items are given that belong to G different item groups (g=1,…,G) and that are piled up in up to S stacks with a maximum stack height H. A move can shift one item from one stack to another one. A sequence of moves of minimum length has to be...
Persistent link: https://www.econbiz.de/10011052644
Container loading is a pivotal function for operating supply chains efficiently. Underperformance results in unnecessary costs (e.g. cost of additional containers to be shipped) and in an unsatisfactory customer service (e.g. violation of deadlines agreed to or set by clients). Thus, it is not...
Persistent link: https://www.econbiz.de/10011052729
Persistent link: https://www.econbiz.de/10005095039