首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements
Authors:Bernard Gendron  Jean-Yves Potvin  Patrick Soriano
Institution:(1) Centre de Recherche sur les Transports and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-ville, Montréal, PQ, Canada, H3C 3J7;(2) Centre de Recherche sur les Transports, Université de Montréal, C.P. 6128, succursale Centre-ville, Montréal, PQ, Canada H3C 3J7
Abstract:In this paper, a tabu search heuristic is combined with slope scaling to solve a discrete depot location problem, known as the multicommodity location problem with balancing requirements. Although the uncapacitated version of this problem has already been addressed in the literature, this is not the case for the more challenging capacitated version, where each depot has a fixed and finite capacity. The slope scaling approach is used during the initialization phase to provide the tabu search with good starting solutions. Numerical results are reported on various types of large-scale randomly generated instances. The quality of the heuristic is assessed by comparing the solutions obtained with those of a commercial mixed-integer programming code.
Keywords:multicommodity capacitated location with balancing requirements  tabu search  slope scaling
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号