A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints

Zachariadis, Emmanouil E.; Tarantilis, Christos D.; Kiranoudis, Chris T.

doi:10.1016/j.ejor.2007.05.058

Cited by 162 publications

(126 citation statements)

References 31 publications

Supporting

Mentioning

111

Contrasting

Unclassified

Order By: Relevance

“…Each heuristic method uses its own criterion to select the coordinates from the list of accessible coordinates; these criteria are shown in Table 1. More detailed information can be found in Zachariadis et al (2009). It should be noted that if none of the heuristic methods can obtain a feasible loading for an assessed route, the route will be reported as infeasible and its objective function will be penalized.…”

Section: Loading Heuristicsmentioning

confidence: 99%

“…The used heuristic methods include: bottom-left fill (Y-axis) (Chazelle, 1983), bottom-left fill (X-axis) (Chazelle, 1983), maximum touching perimeter (Lodi et al, 1999), maximum touching perimeter no walls (Lodi et al, 1999) and minimum area (Zachariadis et al, 2009). When the routing constraints and the weight requirements of a solution are satisfied, these methods will be used (in the mentioned order) to check the loading feasibility of that solution.…”

Section: Loading Heuristicsmentioning

confidence: 99%

See 1 more Smart Citation

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Alinaghian

Zamanlou

Sabbagh

2017

Journal of the Operational Research Society

View full text Add to dashboard Cite

This paper introduces two-dimensional loading time-dependent vehicle routing problem and proposes a biobjective mathematical model. This problem assesses the process of distributing the rectangular-shaped demanded items over an urban environment; it does not, however, allow items to be loaded on top of each other. In addition to the above assumptions, the presented model also satisfies the first-in-first-out property in the timedependent vehicle routing problem. Given the NP-hard nature of the problem, a method called elitist nondominated sorting local search is developed to obtain its solutions. To evaluate the performance of the proposed algorithm, the solutions of this algorithm for small-scale problem instances are compared with the results of an exact method. For the medium-scale problem instances, results of NSGA-II and SPEA2 are used as the basis of comparison. The computational results demonstrate the good performance of the proposed method.

show abstract

Section: Loading Heuristicsmentioning

confidence: 99%

Section: Loading Heuristicsmentioning

confidence: 99%

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Alinaghian

Zamanlou

Sabbagh

2017

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…Cordeau, et al, 1997) (Hertz, et al, 2000) (Côté and Potvin, 2009) (Zachariadis, et al, 2009). Essentially, TS iteratively explores the solution space by moving from the current solution to another solution in its neighborhood.…”

Section: A Tabu Search Algorithmmentioning

confidence: 99%

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

Liu

Xie

Augusto

et al. 2013

European Journal of Operational Research

248

View full text Add to dashboard Cite

International audienceThis paper addresses a vehicle scheduling problem encountered in home health care logistics. It concerns the delivery of drugs and medical devices from the home care company's pharmacy to patients' homes, delivery of special drugs from a hospital to patients, pickup of bio samples and unused drugs and medical devices from patients. The problem can be considered as a special vehicle routing problem with simultaneous delivery and pickup and time windows, with four types of demands: delivery from depot to patient, delivery from a hospital to patient, pickup from a patient to depot and pickup from a patient to a medical lab. Each patient is visited by one vehicle and each vehicle visits each node at most once. Patients are associated with time windows and vehicles with capacity. Two mixed-integer programming models are proposed. We then propose a Genetic Algorithm (GA) and a Tabu Search (TS) method. The GA is based on a permutation chromosome, a split procedure and local search. The TS is based on route assignment attributes of patients, an augmented cost function, route re-optimization, and attribute-based aspiration levels. These approaches are tested on test instances derived from existing VRPTW benchmarks

show abstract

“…Chen et al [8] proposed a binary mathematical model for two-dimensional pallet packing problem for non-uniform box sizes and multiple pallets. Zachariadis et al [9] developed a tabu search meta-heuristic algorithm for vehicle routing problem with two-dimensional loading constraints and tested their algorithm on several benchmark instances. They achieved to several new best solutions.…”

Section: Introductionmentioning

confidence: 99%

“…The constraints consist of two parts: cross-docking consolidation (constraints (2) to (8)) and two dimensional truck loading (constraints (9) to (24)) decisions.…”

mentioning

confidence: 99%

A Mathematical Model for Two Dimensional Loading Problem in Cross-Docking Network Design

Küükoğlu

Aksoy

Ene

et al. 2013

MCA

View full text Add to dashboard Cite

Abstract-In this paper, the transportation problem of cross-docking network is taken into account. Cross-docking centers differ from distribution centers or warehouses in that the loads are transported from origins to destinations through cross-docking centers without storing them for a long time. Goods are unloaded from incoming trucks and reloaded immediately onto outgoing trucks in these cross-docking centers. This problem is formulated using a mixed integer programming with two-dimensional loading constraints. The two-dimensional shapes are applied for both trucks and loads in order to find exact capacity of each truck in basis of each product. The illustrative problems are solved and results show that the proposed model finds practical solutions with twodimensional loading constraints.

show abstract

A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints

Cited by 162 publications

References 31 publications

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem

Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

A Mathematical Model for Two Dimensional Loading Problem in Cross-Docking Network Design

Contact Info

Product

Resources

About