咨询与建议

限定检索结果

文献类型

  • 8 篇 期刊文献

馆藏范围

  • 8 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 6 篇 管理学
    • 6 篇 管理科学与工程(可...
  • 5 篇 理学
    • 4 篇 数学
    • 1 篇 地理学
  • 4 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 电气工程
    • 1 篇 测绘科学与技术

主题

  • 8 篇 multiobjective s...
  • 3 篇 combinatorial op...
  • 3 篇 heuristic search
  • 2 篇 best-first searc...
  • 2 篇 artificial intel...
  • 1 篇 output-sensitive...
  • 1 篇 preferred path p...
  • 1 篇 bidirectional ro...
  • 1 篇 goal programming
  • 1 篇 raster cost surf...
  • 1 篇 pareto optimal s...
  • 1 篇 exact label-sett...
  • 1 篇 best compromise ...
  • 1 篇 stop condition
  • 1 篇 search theory
  • 1 篇 road networks
  • 1 篇 label-setting se...
  • 1 篇 wide path
  • 1 篇 scales of measur...
  • 1 篇 labeling algorit...

机构

  • 2 篇 univ malaga dept...
  • 2 篇 univ malaga dpto...
  • 1 篇 zuse inst berlin...
  • 1 篇 laboratoire d'in...
  • 1 篇 royal inst techn...
  • 1 篇 univ ghent dept ...
  • 1 篇 univ la laguna d...

作者

  • 2 篇 mandow l.
  • 2 篇 machuca e.
  • 2 篇 mandow lawrence
  • 1 篇 sauvanet g.
  • 1 篇 shirabe takeshi
  • 1 篇 demeester piet
  • 1 篇 javier pulido fr...
  • 1 篇 demeyer sofie
  • 1 篇 de las casas ped...
  • 1 篇 pulido francisco...
  • 1 篇 borndoerfer ralf
  • 1 篇 seegmiller linds...
  • 1 篇 perez de la cruz...
  • 1 篇 sedeno-noda anto...
  • 1 篇 audenaert pieter
  • 1 篇 néron e.
  • 1 篇 perez-de-la-cruz...
  • 1 篇 perez de la cruz...
  • 1 篇 pickavet mario
  • 1 篇 goedgebeur jan

语言

  • 8 篇 英文
检索条件"主题词=Multiobjective shortest path problem"
8 条 记 录,以下是1-10 订阅
排序:
Search for the best compromise solution on multiobjective shortest path problem
收藏 引用
Electronic Notes in Discrete Mathematics 2010年 第C期36卷 615-622页
作者: Sauvanet, G. Néron, E. Laboratoire d'Informatique Université François Rabelais - Polytech'Tours 37200 Tours 64 av. Jean Portalis France
This paper deals with the multiobjective shortest path problem in the context of routing for cycling. Many studies focus on the computation of the entire set of Pareto paths. Here we focus on the determination of a we... 详细信息
来源: 评论
multiobjective shortest path problems with lexicographic goal-based preferences
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年 第1期239卷 89-101页
作者: Javier Pulido, Francisco Mandow, Lawrence Perez de la Cruz, Jose Luis Univ Malaga Dept Lenguajes & Ciencias Computac E-29071 Malaga Spain
multiobjective shortest path problems are computationally harder than single objective ones. In particular, execution time is an important limiting factor in exact multiobjective search algorithms. This paper explores... 详细信息
来源: 评论
A comparison of heuristic best-first algorithms for bicriterion shortest path problems
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2012年 第1期217卷 44-53页
作者: Machuca, E. Mandow, L. Perez de la Cruz, J. L. Ruiz-Sepulveda, A. Univ Malaga Dpto Lenguajes & Ciencias Computac E-29071 Malaga Spain
A variety of algorithms have been proposed to solve the bicriterion shortest path problem. This article analyzes and compares the performance of three best-first (label-setting) algorithms that accept heuristic inform... 详细信息
来源: 评论
Dimensionality reduction in multiobjective shortest path search
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2015年 64卷 60-70页
作者: Pulido, Francisco-Javier Mandow, Lawrence Perez-de-la-Cruz, Jose-Luis Univ Malaga Dept Lenguajes & Ciencias Computac E-29071 Malaga Spain
One-to-one multiobjective search in graphs deals with the problem of finding all Pareto-optimal solution paths between given start and goal nodes according to a number of distinct noncommensurate objectives. The probl... 详细信息
来源: 评论
multiobjective heuristic search in road maps
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2012年 第7期39卷 6435-6445页
作者: Machuca, E. Mandow, L. Univ Malaga Dpto Lenguajes & Ciencias Computac E-29071 Malaga Spain
This article considers the application of exact multiobjective techniques to search in large size realistic road maps. In particular, the NAMOA* algorithm is successfully applied to several road networks from the DIMA... 详细信息
来源: 评论
Speeding up Martins' algorithm for multiple objective shortest path problems
收藏 引用
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2013年 第4期11卷 323-348页
作者: Demeyer, Sofie Goedgebeur, Jan Audenaert, Pieter Pickavet, Mario Demeester, Piet Univ Ghent Dept Informat Technol INTEC IBBT B-9050 Ghent Belgium
The latest transportation systems require the best routes in a large network with respect to multiple objectives simultaneously to be calculated in a very short time. The label setting algorithm of Martins efficiently... 详细信息
来源: 评论
A method for finding a least-cost corridor on an ordinal-scaled raster cost surface
收藏 引用
ANNALS OF GIS 2023年 第2期29卷 205-225页
作者: Seegmiller, Lindsi Shirabe, Takeshi Royal Inst Technol KTH Sch Architecture & Built Environm Geoinformat Div Stockholm Sweden
The least-cost path problem is a widely studied problems in geographic information science. In raster space, the problem is to find a path that accumulates the least amount of cost between two locations based on the a... 详细信息
来源: 评论
An Improved multiobjective shortest path Algorithm
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2021年 135卷 105424-105424页
作者: de las Casas, Pedro Maristany Sedeno-Noda, Antonio Borndoerfer, Ralf Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany Univ La Laguna Dept Matemat Estadist & Invest Operat San Cristobal De La Lagu 38271 Santa Cruz De T Spain
We present a new label-setting algorithm for the multiobjective shortest path (MOSP) problem that computes a minimum complete set of efficient paths for a given instance. The size of the priority queue used in the alg... 详细信息
来源: 评论