Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem

Bourbeau, Benoît; Crainic, Teodor Gabriel; Gendron, Bernard

doi:10.1016/s0167-8191(99)00094-0

Cited by 49 publications

(17 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This has been the object of abundant work and a relatively rich literature can be found about the subject. In particular, the sources of parallelism in B&B are now well-identified and one can find several taxonomies and classifications on the subject B&B [49,50,24,8,38]. All these classifications share the following simple observation.…”

Section: Sources Of Parallelismmentioning

confidence: 99%

Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments

Derbel

2016

Future Generation Computer Systems

View full text Add to dashboard Cite

We investigate the design of parallel B&B in large scale heterogeneous compute environments where processing units can be composed of a mixture of multiple shared memory cores, multiple distributed CPUs and multiple GPUs devices. We describe two approaches addressing the critical issue of how to map B&B workload with the different levels of parallelism exposed by the target compute platform. We also contribute a throughout large scale experimental study which allows us to derive a comprehensive and fair analysis of the proposed approaches under different system configurations using up to 16 GPUs and up to 512 distributed cores. Our results shed more light on the main challenges one has to face when tackling B&B algorithms while describing efficient techniques to address them. In particular, we are able to obtain linear speed-ups at moderate scales where adaptive load balancing among the heterogeneous compute resources is shown to have a significant impact on performance. At the largest scales, intranode parallelism and hybrid decentralized load balancing is shown to have a crucial importance in order to alleviate locking issues among shared memory threads and to scale the distributed resources while optimizing communication costs and minimizing idle times.

show abstract

Section: Sources Of Parallelismmentioning

confidence: 99%

Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments

Derbel

2016

Future Generation Computer Systems

View full text Add to dashboard Cite

show abstract

“…This problem, known in the literature as the Multicommodity Capacitated Location Problem with Balancing Requirements (MCLB), was initially studied by Crainic et al (1989). The following authors used several techniques to solve the problem such as branch and bound (Crainic et al 1993a;Gendron, Crainic 1995Bourbeau et al 2000), tabu search (Crainic et al 1993b) or goal programming (Badri 1999). Crainic et al (1993a) did not find an optimal solution in a reasonable time using branch-and-bound and showed that standard methods are not efficient for this problem.…”

Section: Literature Reviewmentioning

confidence: 99%

A decision-making model to design a sustainable container depot logistic network: the case of the port of Valencia

2015

View full text Add to dashboard Cite

Abstract. In this paper, the design of a maritime container depot logistic network in a hinterland is studied. Containers are a basic tool in multimodal product transportation and all related operations have an impact on the environment due to different externalities such as noise, atmospheric and visual pollution. A three objective optimization model is used to minimize the total network cost, the environmental impact generated by the road transport operations associated with the depots (TI) and the environmental impact generated by the setting up and maintenance of the depots (FI). To determine the environmental impacts of each depot, Fuzzy Analytic Hierarchy Process (F-AHP) is used in both cases. In addition, a fuzzy multiobjective optimization approach has been used to solve the problem. The application case study is based on the Port of Valencia (Spain).

show abstract

“…The authors propose a multiple-list implementation in which each process has its own local pool of subproblems. Finally, Bourbeau et al (2000) further improve the existing parallelization strategies for branch-and-bound algorithms on the problem.…”

Section: Planning Models Integrating Strategic and Tactical Decisionsmentioning

confidence: 99%

Optimization of empty container movements in intermodal transport

Braekers¹

2012

4OR-Q J Oper Res

View full text Add to dashboard Cite

Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem

Cited by 49 publications

References 16 publications

Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments

Parallel Branch-and-Bound in multi-core multi-CPU multi-GPU heterogeneous environments

A decision-making model to design a sustainable container depot logistic network: the case of the port of Valencia

Optimization of empty container movements in intermodal transport

Contact Info

Product

Resources

About