Minimum cost path problems with relays

Laporte, Gilbert; Pascoal, Marta

doi:10.1016/j.cor.2010.04.010

Cited by 60 publications

(37 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The lack of costs in pure service-oriented hub center and hub covering models have found more reasonable applications in telecom than in transportation. Confirming this analysis of Campbell and O'Kelly (2012), RLP literature discussed in this paper as well as a closely related network design problem with relays of Cabral et al (2007), Laporte and Pascoal (2011) and Kewcharoenwong and Uster (2014) seem to be confined to the field of telecommunications. In this regard, we shall attempt to describe transportation-related settings and motivations where RLP and its close variants can be of interest.…”

Section: Applications/limitations In Transportation Settingsmentioning

confidence: 49%

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Yıldız

Karaşan

2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

Survivable network design Branch and cut a b s t r a c tIn a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem seeks to place the minimum number of regenerators in an optical network so as to facilitate the communication of a signal between any node pair. In this study, the Regenerator Location Problem is revisited from the hub location perspective directing our focus to applications arising in transportation settings. Two new dimensions involving the challenges of survivability are introduced to the problem. Under partial survivability, our designs hedge against failures in the regeneration equipment only, whereas under full survivability failures on any of the network nodes are accounted for by the utilization of extra regeneration equipment. All three variations of the problem are studied in a unifying framework involving the introduction of individual flow-based compact formulations as well as cut formulations and the implementation of branch and cut algorithms based on the cut formulations. Extensive computational experiments are conducted in order to evaluate the performance of the proposed solution methodologies and to gain insights from realistic instances.

show abstract

Section: Applications/limitations In Transportation Settingsmentioning

confidence: 49%

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Yıldız

Karaşan

2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

show abstract

“…Routing in a network with battery switching stations is also considered in the literature (Yang and Sun, 2015). Even though it is presented in a different context, Laporte and Pascoal (2011) present a methodology that can also be customized to solve the MCPP-EV problem in a network with battery switching stations. In the existing MCPP-EV studies, battery degradation costs are not considered.…”

Section: Related Literaturementioning

confidence: 99%

Minimum cost path problem for Plug-in Hybrid Electric Vehicles

Arslan

Yıldız

Karaşan

2015

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

a b s t r a c tWe introduce a practically important and theoretically challenging problem: finding the minimum cost path for PHEVs in a road network with refueling and charging stations. We show that this problem is NP-complete and present a mixed integer quadratically constrained formulation, a discrete approximation dynamic programming heuristic, and a shortest path heuristic as solution methodologies. Practical applications of the problem in transportation and logistics, considering specifically the long-distance trips, are discussed in detail. Through extensive computational experiments, significant insights are provided. In addition to the charging infrastructure availability, a driver's stopping tolerance arises as another critical factor affecting the transportation costs.

show abstract

“…For each hop, the relay node that proposes the best channel and consumes the least energy is selected and considered as a part of the route. In order to solve this dilemma, we represent it by the Minimum Cost Path problem With Relays [13]. In this problem, relay nodes serve as optimizer nodes that help to reduce the cost and hence optimize the quality of the links.…”

Section: Problem Formulationmentioning

confidence: 99%

“…More precisely, we present the used network and channel models and the problem formulation. Our models are based on two studies [12], [13] where the WSN is represented as a graph. RBCR searches for the shortest path in term of three objectives: the energy consumed by the intermediate nodes, the one consumed by the relays and the quality of the cooperative links.…”

Section: Problem Formulationmentioning

confidence: 99%

A combined relay-selection and routing protocol for cooperative wireless sensor networks

Nacef¹,

Senouci

Ghamri‐Doudane

et al. 2012

2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC)

View full text Add to dashboard Cite

Abstract-In wireless sensor networks several constraints decrease communications performances. In fact, channel randomness and energy restrictions make classical routing protocols inefficient. Therefore, the design of new routing protocols that cope with these constraints become mandatory. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances in term of delivery ratio, power consumption and traffic load.

show abstract

Minimum cost path problems with relays

Cited by 60 publications

References 9 publications

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Minimum cost path problem for Plug-in Hybrid Electric Vehicles

A combined relay-selection and routing protocol for cooperative wireless sensor networks

Contact Info

Product

Resources

About