NDLI: Multiobjective scatter search for a commercial territory design problem

Content Provider	Springer Nature Link
Author	Salazar Aguilar, M. Angélica Ríos Mercado, Roger Z. González Velarde, José L. Molina, Julián
Copyright Year	2012
Abstract	In this paper, a multiobjective scatter search procedure for a bi-objective territory design problem is proposed. A territory design problem consists of partitioning a set of basic units into larger groups that are suitable with respect to some specific planning criteria. These groups must be compact, connected, and balanced with respect to the number of customers and sales volume. The bi-objective commercial territory design problem belongs to the class of NP-hard problems. Previous work showed that large instances of the problem addressed in this work are practically intractable even for the single-objective version. Therefore, the use of heuristic methods is the best alternative for obtaining approximate efficient solutions for relatively large instances. The proposed scatter search-based framework contains a diversification generation module based on a greedy randomized adaptive search procedure, an improvement module based on a relinked local search strategy, and a combination module based on a solution to an assignment problem.The proposed metaheuristic is evaluated over a variety of instances taken from literature. This includes a comparison with two of the most successful multiobjective heuristics from literature such as the Scatter Tabu Search Procedure for Multiobjective Optimization (SSPMO) by Molina et al. (INFORMS J. Comput. 19(1):91–100, 2007), and the Non-dominated Sorting Genetic Algorithm (NSGA-II) by Deb et al. (Parallel problem solving from nature – PPSN VI, Lecture notes in computer science, vol. 1917, Springer, Berlin, pp. 849–858, 2000). Experimental work reveals that the proposed procedure consistently outperforms both heuristics, SSPMO and NSGA-II, on all instances tested.
Starting Page	343
Ending Page	360
Page Count	18
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	199
Issue Number	1
e-ISSN	15729338
Language	English
Publisher	Springer US
Publisher Date	2012-01-04
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Territory design Bi-objective programming Pareto frontier Metaheuristics Scatter search Theory of Computation Combinatorics Operations Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Scatter Search for Network Design Problem

Scatter search for the cutwidth minimization problem

A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm

Hybrid scatter tabu search for unconstrained global optimization

GRASP strategies for a bi-objective commercial territory design problem

A Pareto-based search methodology for multi-objective nurse scheduling

Bi-objective burn-in modeling and optimization

Adaptive memory programming for matrix bandwidth minimization

Scatter search for the single source capacitated facility location problem

Multiobjective scatter search for a commercial territory design problem

Similar Documents

Scatter Search for Network Design Problem

Scatter search for the cutwidth minimization problem

A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm

Hybrid scatter tabu search for unconstrained global optimization

GRASP strategies for a bi-objective commercial territory design problem

A Pareto-based search methodology for multi-objective nurse scheduling

Bi-objective burn-in modeling and optimization

Adaptive memory programming for matrix bandwidth minimization

Scatter search for the single source capacitated facility location problem

Multiobjective scatter search for a commercial territory design problem