The capacitated general windy routing problem with turn penalties

Micó, Joan C.; Soler, David

doi:10.1016/j.orl.2011.04.007

Cited by 9 publications

(6 citation statements)

References 17 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Each of these classes could be consisted of irregular or regular services. Soler et al (2011) presented the capacitated general windy routing problem with turn penalties which is vital for real-life problems and includes many important and wellknown arc and node routing problems. (Beraldi et al 2015) studied the general routing problem under uncertainty (demand is stochastic), in which a chance-constrained integer programming formulation was taken into account.…”

Section: Literature Review and Background Of The Problemmentioning

confidence: 99%

Water Truck Routing Optimization in Open Pit Mines Using the General Algebraic Modelling System Approach

Khajouei

Lotfi

Ebrahimi

et al. 2021

Communications in Computer and Information Science

View full text Add to dashboard Cite

This paper presents a methodological approach for routing optimization in open pit mines which is a trending topic for dust emission reduction in mining process. In this context, the aim of the research and its contribution to the knowledge is firstly described based on a comprehensive literature survey in the field. Then, as an arc routing problem, the mathematical model for the process is generated including the objective function, minimizing the total distance traveled by the water truck fleets, practical constraints that should be met and the used assumptions. Finally, the formulated optimization problem solved employing General Algebraic Modelling System (GAMS) approach respect to the nature of the mathematical equations. The tested results by simulations discussed to confirm the effectiveness of the proposed method in dealing with the in-hand problem. This methodological approach could be used in optimization of other similar engineering problem as well.

show abstract

Section: Literature Review and Background Of The Problemmentioning

confidence: 99%

Water Truck Routing Optimization in Open Pit Mines Using the General Algebraic Modelling System Approach

Khajouei

Lotfi

Ebrahimi

et al. 2021

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…Other K‐GRPs. Bräysy et al and Micó and Soler address the capacitated GRP (CGRP) with turn penalties and forbidden turns. The first authors do it on a mixed graph while the second authors consider a windy version.…”

Section: Multiple Vehicle Arc Routing Problems (K‐arps)mentioning

confidence: 99%

“…The first authors do it on a mixed graph while the second authors consider a windy version. The work of proposes a transformation of the windy CGRP with turn penalties into an asymmetric capacitated vehicle routing problem. Likewise, Bräysy et al present a transformation of the MCGRP into an asymmetric capacitated vehicle routing problem and also use it to obtain feasible solutions with a memetic algorithm for node routing.…”

Section: Multiple Vehicle Arc Routing Problems (K‐arps)mentioning

confidence: 99%

An updated annotated bibliography on arc routing problems

Mourão

Pinto

2017

Networks

View full text Add to dashboard Cite

The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017

show abstract

“…It is worth commenting here that the idea of solving a single-vehicle routing problem by transforming it into an ATSP through an AGTSP has been recently generalized to solve different hard multivehicle routing problems, as we can see through the papers by Soler et al (2009), Baldacci et al (2010, Bräysy et al (2011), and Micó and Soler (2011).…”

Section: Given a Directed Graph G = (V A) With Nonnegative Costs Assmentioning

confidence: 99%