Parallel VNS for Bus Terminal Location Problem

Djenić, Aleksandar; Radojičić, Nina; Marić, Miroslav; Mladenović, Nenad

doi:10.1016/j.asoc.2016.02.002

Cited by 22 publications

(9 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A variant of this approach, called Reduced VNS (RVNS) [29,30], skips the local search at step 2b, to keep v = v. RVNS is equivalent to a BBA where nb = 1, nr = 1, and ns = 0 (no global search). Parallel VNS [31,32] resembles more closely the BA, since it performs a number of concomitant local VNS search procedures. The main difference between VNS and the BA is that the former uses a randomly generated sequence of neighbourhood sizes for local search, whilst the latter uses a fixed (BBA) or deterministically shrunk (ShBA) neighbourhood size.…”

Section: Variable Neighbourhood Searchmentioning

confidence: 99%

An analysis of the search mechanisms of the bees algorithm

Baronti

Castellani

2020

Swarm and Evolutionary Computation

View full text Add to dashboard Cite

Link to publication on Research at Birmingham portal General rights Unless a licence is specified above, all rights (including copyright and moral rights) in this document are retained by the authors and/or the copyright holders. The express permission of the copyright holder must be obtained for any use of this material other than for purposes permitted by law. • Users may freely distribute the URL that is used to identify this publication. • Users may download and/or print one copy of the publication from the University of Birmingham research portal for the purpose of private study or non-commercial research. • User may use extracts from the document in line with the concept of 'fair dealing' under the Copyright, Designs and Patents Act 1988 (?) • Users may not further distribute the material nor use it for the purposes of commercial gain. Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document. When citing, please reference the published version. Take down policy While the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.

show abstract

Section: Variable Neighbourhood Searchmentioning

confidence: 99%

An analysis of the search mechanisms of the bees algorithm

Baronti

Castellani

2020

Swarm and Evolutionary Computation

View full text Add to dashboard Cite

show abstract

“…• Low-level parallelism in which parts of the code are dispatched between a set of process, according to the master-slave computing model, to minimize the execution time [35,36]. • Domain decomposition where the solution space is divided into multiple areas that are later on dispatched between a set of parallel processors.…”

Section: Comparison With Previous Parallel Vns Approachesmentioning

confidence: 99%

Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

et al. 2020

View full text Add to dashboard Cite

In job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

show abstract

“…The BTLP is a kind of facility location problem (FLP) ( 1, 2 ) that can also be formulated as a hub location problem (HLP), which is considered to be a new extension of a FLP ( 3 ). An HLP is usually studied as an NP-hard (non-deterministic polynomial-time hard) problem ( 1, 4 ). Early studies of the HLP go back to the 60’s and 70’s ( 5–7 ).…”

Section: Literature Reviewmentioning

confidence: 99%

“…Lü et al and Lü and Tian defined hubs as facilities that are in places where the maximum amount of people and jobs are served within a reasonable walking area ( 17, 18 ). This area can be defined as a circle of radius r around the hub or terminal as noted by Djenić et al and Ghanbari and Mahdavi-Amiri ( 1, 2 ). As Gelareh and Nickel mentioned, public transport networks often operate on a hub-and-spoke network structure ( 19 ).…”

Section: Literature Reviewmentioning

confidence: 99%

Multi-Step Heuristic Method for Bus Terminal Location Problem

Zamanian¹,

Peiravian

2019

Transportation Research Record

View full text Add to dashboard Cite

Bus terminals are one of the main facilities that have a key role in the collection and distribution of passengers within an urban transportation network. The location of a bus terminal strongly affects its performance. Owing to the increasing demand, it is sometimes necessary to add a new bus terminal to the existing urban bus network. Finding a proper location, however, is a challenge that is influenced by different transportation and socio-economic considerations, which in turn affects the surrounding land-use and traffic patterns. In this paper, a new multi-step heuristic method is proposed for the bus terminal location problem to identify a new bus terminal location based on the existing network as well as other transportation considerations and constraints. This is achieved by identifying the existing bus stops that have the greatest potential to be turned into a bus terminal. Other factors taken into consideration are the locations of the existing bus terminals, adjacent land-use, construction costs, node connectivity, and system accessibility. Owing to the multi-objective nature of the problem, a goal programming approach is used to formulate the objective function. To evaluate the proposed model, it was applied to the city of Shiraz in Iran. The results show that the model can provide acceptable and reliable outcomes.

show abstract

Parallel VNS for Bus Terminal Location Problem

Cited by 22 publications

References 30 publications

An analysis of the search mechanisms of the bees algorithm

An analysis of the search mechanisms of the bees algorithm

Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

Multi-Step Heuristic Method for Bus Terminal Location Problem

Contact Info

Product

Resources

About