NDLI: An interactive multiobjective programming approach to tour route planning problems

Content Provider	IEEE Xplore Digital Library
Author	Katagiri, H. Uno, T. Kato, K. Tsuda, H. Tsubaki, H.
Copyright Year	2013
Description	Author affiliation: Fac. of Appl. Inf. Sci., Hiroshima Inst. of Technol., Hiroshima, Japan (Kato, K.) \|\| Inst. of Stat. Math., Tokyo, Japan (Tsubaki, H.) \|\| Grad. Sch. of Eng., Hiroshima Univ., Higashi-Hiroshima, Japan (Katagiri, H.) \|\| Dept. of Math. Sci., Doshisha Univ., Kyotanabe, Japan (Tsuda, H.) \|\| Inst. of Socio-Arts & Sci., Univ. of Tokushima, Tokushima, Japan (Uno, T.)
Abstract	This article considers tour route planning problems to find an optimal tour route in sightseeing. Tour routes are optimized in terms of two types of criteria. The first optimization criterion is to maximize the sum of values of places a tourist visits, namely, the sum of the values of sightseeing spots, restaurants and hotels. The second optimization criterion is to minimize the tiredness caused by moving from place to place, which is dependent on means of transportation. This paper provides a problem formulation of a tour route planning problem as a multiobjective mixed 0-1 programming problem in which the number of constraints is a polynomial order of the number of places possible to visit or stay. An interactive algorithm is provided in order to find a satisficing solution reflecting tourist's preferences.
Starting Page	167
Ending Page	171
File Size	591739
Page Count	5
File Format	PDF
ISBN	9781467357258
ISSN	18833977
e-ISBN	9781467357265
DOI	10.1109/IWCIA.2013.6624807
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-07-13
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Interactive algorithm Multiobjective programming Programming Pareto optimization Linear programming Educational institutions Tour route planning Planning Electronic mail Mixed 0-1 programming
Content Type	Text
Resource Type	Article

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

An interactive approach to multiobjective tour route planning problems

A novel multiobjective optimization algorithm for 0/1 multiobjective knapsack problems

Multiobjective test problems with complicated Pareto fronts: Difficulties in degeneracy

Calculating Complete and Exact Pareto Front for Multiobjective Optimization: A New Deterministic Approach for Discrete Problems

An Approximation Algorithm for Nonlinear 0-1 Integer Programming Problems

Personal tour planning incorporating standard tour routes and tourist satisfaction

Multiobjective Evolutionary Algorithm Based on Dynamic Encoding and Population Isolating

Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

Interactive multiobjective random fuzzy programming: Necessity-based value at risk model

An interactive multiobjective programming approach to tour route planning problems

Similar Documents

An interactive approach to multiobjective tour route planning problems

A novel multiobjective optimization algorithm for 0/1 multiobjective knapsack problems

Multiobjective test problems with complicated Pareto fronts: Difficulties in degeneracy

Calculating Complete and Exact Pareto Front for Multiobjective Optimization: A New Deterministic Approach for Discrete Problems

An Approximation Algorithm for Nonlinear 0-1 Integer Programming Problems

Personal tour planning incorporating standard tour routes and tourist satisfaction

Multiobjective Evolutionary Algorithm Based on Dynamic Encoding and Population Isolating

Evolution of hyperheuristics for the biobjective 0/1 knapsack problem by multiobjective genetic programming

Interactive multiobjective random fuzzy programming: Necessity-based value at risk model

An interactive multiobjective programming approach to tour route planning problems