The Rollon-Rolloff Vehicle Routing Problem

Bodin, Lawrence; Mingozzi, Aristide; Baldacci, Roberto; Ball, Michael
August 2000
Transportation Science;Aug2000, Vol. 34 Issue 3, p271
Academic Journal
In this paper, a sanitation routing problem called the Rollon-Rolloff Vehicle Routing Problem (RRVRP) is defined. In the RRVRP, tractors move large trailers between locations and a disposal facility. The trailers are so large that the tractor can only transport one trailer at a time. In this paper, the RRVRP is defined, a mathematical programming formulation is presented, and two lower bounds and four heuristic algorithms are developed and tested on 20 different problems. Conclusions are derived and recommendations for further research are presented.


Related Articles

  • Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach. Hongqi Li; Yue Lu; Jun Zhang; Tianyi Wang // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    We study the tractor and semi-trailer routing problem (TSRP), a variant of the vehicle routing problem (VRP). In the TSRP model for this paper, vehicles are dispatched on a trailer-flow network where there is only one main depot, and all tractors originate and terminate in the main depot. Two...

  • A tabu search algorithm for the covering design problem. Fadlaoui, Kamal; Galinier, Philippe // Journal of Heuristics;Dec2011, Vol. 17 Issue 6, p659 

    A ( v, k, t)-covering design is a collection of k-subsets (called blocks) of a v-set ${\mathcal{V}}$ such that every t-subset of ${\mathcal{V}}$ is contained in at least one block. Given v, k and t, the goal of the covering design problem is to find a covering made of a minimum number of blocks....

  • Algorithms for the Set Covering Problem. Caprara, Alberto; Toth, Paolo; Fischetti, Matteo // Annals of Operations Research;2000, Vol. 98 Issue 1-4, p353 

    The Set Covering Problem (SCP) is a main model for several important applications, including crew scheduling in railway and mass-transit companies. In this survey, we focus our attention on the most recent and effective algorithms for SCP, considering both heuristic and exact approaches,...

  • Exact and heuristic procedures for solving the fuzzy portfolio selection problem. Cadenas, J.; Carrillo, J.; Garrido, M.; Ivorra, C.; Liern, V. // Fuzzy Optimization & Decision Making;Mar2012, Vol. 11 Issue 1, p29 

    We propose a fuzzy model for the portfolio selection problem which takes into account the vagueness of the investor's preferences regarding the assumed risk. We also describe an exact method for solving it as well as a hybrid meta-heuristic procedure which is more adequate for medium and...

  • A Low-Order Knowledge-Based Algorithm (LOKBA) to Solve Binary Integer Programming Problems. Pakzad-Moghadam, S. H.; Shahmohammadi, M. S.; Ghodsi, R. // International Journal of Academic Research in Business & Social ;Jan2012, Vol. 2 Issue 1, p247 

    In this paper a novel and very fast low order knowledge-based algorithm (called LOKBA) is presented to solve binary integer programming (BIP) problems. The factors in the objective function and the constraints of any BIP problem contains specific knowledge and information that can be used to...

  • RULE WEIGHTS IN A NEURO-FUZZY SYSTEM WITH A HIERARCHICAL DOMAIN PARTITION. SIMIƃSKI, KRZYSZTOF // International Journal of Applied Mathematics & Computer Science;Jun2010, Vol. 20 Issue 2, p337 

    The paper discusses the problem of rule weight tuning in neuro-fuzzy systems with parameterized consequences in which rule weights and the activation of the rules are not interchangeable. Some heuristic methods of rule weight computation in neuro-fuzzy systems with a hierarchical input domain...

  • Optimal location with equitable loads. Berman, Oded; Drezner, Zvi; Tamir, Arie; Wesolowsky, George O. // Annals of Operations Research;Mar2009, Vol. 167 Issue 1, p307 

    The problem considered in this paper is to find p locations for p facilities such that the weights attracted to each facility will be as close as possible to one another. We model this problem as minimizing the maximum among all the total weights attracted to the various facilities. We propose...

  • Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. Hewitt, Mike; Nemhauser, George L.; Savelsbergh, Martin W. P. // INFORMS Journal on Computing;Spring2010, Vol. 22 Issue 2, p314 

    We develop a solution approach for the fixed-charge network flow (FCNF) problem that produces provably high-quality solutions quickly. The solution approach combines mathematical programming algorithms with heuristic search techniques. To obtain high-quality solutions, it relies on neighborhood...

  • High Repair Efficiency BIRA Algorithm with a Line Fault Scheme. Taewoo Han; Woosik Jeong; Youngkyu Park; Sungho Kang // ETRI Journal;Aug2010, Vol. 32 Issue 4, p642 

    With the rapid increase occurring in both the capacity and density of memory products, test and repair issues have become highly challenging. Memory repair is an effective and essential methodology for improving memory yield. An SoC utilizes builtin redundancy analysis (BIRA) with built-in...


Read the Article


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

Try another library?
Sign out of this library

Other Topics