Visiting-Time-Shortening Framework Considering Pareto Optimality in Theme Park Problem
- 1 January 2018
- journal article
- Published by Japanese Society for Artificial Intelligence in Transactions of the Japanese Society for Artificial Intelligence
- Vol. 33 (2)
- https://doi.org/10.1527/tjsai.c-h98
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Statement-based Cost Estimate for Co-utilization of Service FacilitiesJournal of Information Processing, 2014
- The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood SearchEuropean Journal of Operational Research, 2012
- The orienteering problem: A surveyEuropean Journal of Operational Research, 2011
- The multiple traveling salesman problem: an overview of formulations and solution proceduresOmega, 2006
- Distributed Visitors Coordination System in Theme Park ProblemLecture Notes in Computer Science, 2005
- Modeling of Theme Park Problem with Multiagent for Mass User SupportLecture Notes in Computer Science, 2004
- Mass User Support by Social Coordination among Citizens in a Real EnvironmentLecture Notes in Computer Science, 2004
- Investigation of Global Performance Affected by Congestion Avoiding Behavior in Theme Park ProblemIEEJ Transactions on Electronics, Information and Systems, 2004
- The team orienteering problemEuropean Journal of Operational Research, 1996