Districting for salt spreading operations

Muyldermans, Luc; Cattrysse, Dirk; Oudheusden, Dirk Van; Lotan, Tsippy

doi:10.1016/s0377-2217(01)00184-9

Cited by 103 publications

(55 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Muyldermans et al [21,22] address the problem of districting for salt spreading operations on roads. They assume that each district is served by a single facility aiming to minimize the deadheading distances and the number of vehicles required to service the region.…”

Section: Literature Reviewmentioning

confidence: 99%

A GRASP‐Tabu Heuristic Approach to Territory Design for Pickup and Delivery Operations for Large‐Scale Instances

González-Ramírez

Smith

Askin

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We address a logistics districting problem faced by a parcel company whose operations consist of picking up and delivering packages over a service region. The districting process aims to find a partition of the service region into delivery and collection zones that may be served by a single vehicle that departs from a central depot. Criteria to be optimized are to balance workload content among the districts and to create districts of compact shape. A solution approach based on a hybrid procedure that combines elements of GRASP and Tabu Search (TS) is proposed to solve large-scale instances. Numerical experimentation is performed considering different instance sizes and types. Results show that the proposed solution approach is able to solve large-scale instances in reasonable computational times with good quality of the solutions obtained. To determine the quality of the solutions, results are compared with CPLEX solutions and with the current real solution to highlight the benefits of the proposed approach. Conclusions and recommendations for further research are provided.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A GRASP‐Tabu Heuristic Approach to Territory Design for Pickup and Delivery Operations for Large‐Scale Instances

González-Ramírez

Smith

Askin

et al. 2017

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…In the last one, only the partitioning problem is solved. In some cases, the partitioning is solved keeping in mind that the application is an arc routing problem (Muyldermans et al, 2002(Muyldermans et al, , 2003Perrier et al, 2008;Assis et al, 2014) and in others that the application is on a node routing problem (Mourgaya and Vanderbeck, 2007;Lin and Kao, 2008;Ríos-Mercado and Fernández, 2009;Gonzalez-Ramírez et al, 2011;Jarrah and Bard, 2012;Lei et al, 2012;Salazar-Aguilar et al, 2012).…”

Section: Literature Reviewmentioning

confidence: 99%

“…Also, too many intersections of the service areas of different vehicles can complicate the activities to be held in a region (see e.g., Muyldermans et al (2002); Mourgaya and Vanderbeck (2007)). According to Kim et al (2006) and Poot et al (2002) for instance, solutions with an excessive number of vehicle crossovers tend to be rejected by the practitioners.…”

Section: Introductionmentioning

confidence: 99%

The mixed capacitated arc routing problem with non-overlapping routes

Constantino

Gouveia

Mourão

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

Real world applications for vehicle collection or delivery along streets usually lead to arc routing problems, with additional and complicating constraints. In this paper we focus on arc routing with an additional constraint to identify vehicle service routes with a limited number of shared nodes, i.e. vehicle service routes with a limited number of intersections. This constraint leads to solutions that are better shaped for real application purposes. We propose a new problem, the bounded overlapping MCARP (BCARP), which is defined as the mixed capacitated arc routing problem (MCARP) with an additional constraint imposing an upper bound on the number of nodes that are common to different routes. The best feasible upper bound is obtained from a modified MCARP in which the minimization criteria is given by the overlapping of the routes. We show how to compute this bound by solving a simpler problem. To obtain feasible solutions for the bigger instances of the BCARP heuristics are also proposed. Computational results taken from two well known instance sets show that, with only a small increase in total time traveled, the model BCARP produces solutions that are more attractive to implement in practice than those produced by the MCARP model.

show abstract

“…This process is carried out by clustering the units into a smaller number M of zones in order to create a new spatial structure that reflects a specific set of criteria. The issue of spatial partitioning is present in a wide spectrum of applications, as evinced by the literature on demarcating political-electoral districts (Horn 1995, Ricca and Simeone 1997e, Mehrotra et al 1998; delimitating socio-economic zones under a particular jurisdiction or administrative control (Openshaw and Alvanides 2001, Alvanides et al 2002, Martin 2003; delimitating market areas or sales 'territories' (Zoltners and Sinha 1983, Rios-Mercado and Fernandez 2009; delimitating school districts (Caro et al 2004, Ahmadi 2006; demarcating zones for delivering mobile domiciliary services, such as planning salt apportionment operations on roads (Muyldermans et al 2002) and demarcating police districts (D'Amico et al 2002); delimitating zones that receive energy resources (electrical power) (Bergey et al 2003, Tiede andStrobl 2006); and finally, delimitating zones for land-use allocation and/or land acquisition and apportionment (Cova and Church 2000, Aerts and Heuvelink 2002, Williams 2002.…”

Section: Introductionmentioning

confidence: 99%