Optimizing Auto-Carrier Loading

Agbegha, Gerald Y.; Ballou, Ronald H.; Mathur, Kamlesh
May 1998
Transportation Science;May98, Vol. 32 Issue 2, p174
Academic Journal
Delivering automobiles, vans, and trucks to auto dealerships is a unique problem among the routing and scheduling problem class. A subproblem is that of loading the vehicles onto an auto-carrier (equipment specially designed for this purpose). Allocation of the vehicles to this equipment has typically been done by means of trial and error and heuristic methods. This paper shows how the loading aspect of the delivery problem can be solved using optimizing methods. The approach has the potential of replacing the empirical methods currently used in practice.


Related Articles

  • HANDLE WITH CARE.  // Contract Journal;5/14/2008, Vol. 443 Issue 6675, p21 

    The article reports that Stonegrave Aggregates has taken delivery of its first volvo L150F loading shovel for rehandling duties at its Aycliffe Quarry located near Darlington, England. Volvo's L150F features a 4.2m3 shovel and a 12-litre Stage 3a engine developing 212kW at 1,400rpm.

  • In This Issue.  // Transportation Science;Feb95, Vol. 29 Issue 1, p1 

    The article discusses various articles published in the 1995 issue of the journal "Transportation Science." One of the articles published was "The Airline Exception Scheduling Problem." It describes a network flow optimization model that efficiently and effectively schedules such changes...

  • Multiple orders per job batch scheduling with incompatible jobs. Erramilli, Vishnu; Mason, Scott J. // Annals of Operations Research;Mar2008, Vol. 159 Issue 1, p245 

    The multiple orders per job ( MOJ) scheduling problem is presented for the batch-processing environment such as that exemplified by diffusion ovens. A mixed-integer programming formulation is presented for the incompatible job family case wherein only jobs that belong to the same family may be...

  • A tabu-search heuristic for the flexible-resource flow shop scheduling problem. Daniels, Richard L.; Mazzola, Joseph B. // Annals of Operations Research;1993, Vol. 41 Issue 1-4, p207 

    This paper presents a tabu-search heuristic for the flexible-resource flow shop scheduling (FRFS) problem [7]. The FRFS problem generalizes the classic flow shop scheduling problem by allowing job-operation processing times to depend on the amount of resource assigned to an operation; the...

  • A constructive heuristic for minimizing makespan in no-wait flow shop scheduling. Laha, Dipak; Chakraborty, Uday K. // International Journal of Advanced Manufacturing Technology;May2009, Vol. 41 Issue 1/2, p97 

    This paper presents a new constructive heuristic, based on the principle of job insertion, for minimizing makespan in no-wait permutation flow shop scheduling problems. Empirical results demonstrate the superiority of the proposed approach over four of the best-known methods in the literature....

  • SCHEDULING AND SEQUENCING. Hall, Nicholas G.; Magazine, Michael // Encyclopedia of Operations Research & Management Science;2001, p734 

    This entry provides information on the concept of scheduling as applied to factory and computer systems. The scheduling function typically takes place at the operational level, which represent some measure of throughput, customer satisfaction or costs. To solve most scheduling problems,...

  • A NOTE ON THE WEIGHTED TARDINESS PROBLEM. Rachamadugu, Ram Mohan V. // Operations Research;May/Jun87, Vol. 35 Issue 3, p450 

    We identify a condition characterizing adjacent jobs in an optimal sequence for the weighted tardiness problem. This condition can be used as an effective pruning device in enumerative methods. Further, we show that the Modified Due Date Rule is a special case of this condition. Lastly, we...

  • Tailgate hoist.  // Design News;3/23/92, Vol. 48 Issue 6, p52 

    This article reports that tailgate hoist developed by Western Australia-based Loader Co., is sized for vans, hatchbacks and station wagons. The loader lifts cargo to the vehicle's load deck, and rolls it home. Two sets of drive chains provide a smooth transition from vertical to horizontal...

  • Aplicación de un algoritmo ACO al problema de taller de flujo de permutación con tiempos de preparación dependientes de la secuencia y minimización de makespan. Hornig, Eduardo Salazar; Weber, Natalia Pavón // INGENIARE - Revista Chilena de Ingeniería;may-ago2011, Vol. 19 Issue 2, p253 

    This paper studied the permutation flowshop with sequence dependent setup times and makespan minimization. An ant colony algorithm which turns the original problem into an asymmetric TSP (Traveling Salesman Problem) structure is presented, and applied to problems proposed in the literature and...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics