- Tài khoản và mật khẩu chỉ cung cấp cho sinh viên, giảng viên, cán bộ của TRƯỜNG ĐẠI HỌC FPT
- Hướng dẫn sử dụng: Xem Video .
- Danh mục tài liệu mới: Tại đây .
- Đăng nhập : Tại đây .
SỐ LƯỢT TRUY CẬP


accurate visitors web counter
Visits Counter
FPT University|e-Resources > Bài báo khoa học (Scientific Articles) > Articles published by FPT lecturers >
Please use this identifier to cite or link to this item: http://ds.libol.fpt.edu.vn/handle/123456789/1991

Title: Solving the close‐enough arc routing problem
Authors: Minh, Hoang Ha
Bostel, Nathalie
Langevin, André
Rousseau, Louis-Martin
Keywords: Close-enough arc routing problem
Close-enough traveling salesman problem
Automated meter reading
Radio frequency identification
Branch-and-cut algorithm
Issue Date: 1-Jan-2014
Abstract: Abstract The close-enough arc routing problem has an interesting real-life application to routing for meter reading. In this article, we propose a new mathematical formulation for this problem. We analyze our formulation and compare it with two formulations in the literature. We also develop branch-and-cut algorithms to solve the problem to optimality. We present computational results for instances based on three types of graphs: directed, undirected, and mixed. Copyright© 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63 (1), 107–118 2014
Description: 11 pages
URI: http://ds.libol.fpt.edu.vn/handle/123456789/1991
Appears in Collections:Articles published by FPT lecturers

Files in This Item:

File Description SizeFormat
Solving_the_close.pdfFree165.88 kBAdobe PDF book.png
View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

  Collections Copyright © FPT University

FSE Hoa Lac Library

Add : Room 107, 1st floor, Hoa Lac campus, Km28 Thang Long Avenue, Hoa Lac Hi-Tech Park

Office tel: + 844.66805912  / Email :  thuvien_fu_hoalac@fpt.edu.vn

 - Feedback