Paper Abstract and Keywords |
Presentation |
2022-05-19 13:00
Transportation Problem on a Graph Tetsuo Asano (Kanazawa Univ.) COMP2022-1 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
We consider a transportation problem defined on a node-weighted undirected graph. Weight is positive if the amount of commodity is stored at a node, and negative if the amount is needed at the node. We want to meet all demands by transporting commodities using vehicles prepared either at nodes or edges which only travel to and from neighbors. In a trip from a node to a neighbor we can send commodities and also bring back some other commodities. Problem is to decide whether we can meet all demands by carrying out a set of trips in a few rounds. We define three different schemes to solve the problem and examine their performances. We present a polynomial-time algorithm for deciding whether there is a single round of trips using one vehicle at each node that meet all demands for one-commodity case. Although extension to multi-commodity case is unknown, we can also extend it to multiple rounds as far as the number of iterations is bounded by a constant. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Linear programming / One-commodity and multi-commodity problems / Polynomial-time algorithm / Transportation problem / Vehicle / / / |
Reference Info. |
IEICE Tech. Rep., vol. 122, no. 33, COMP2022-1, pp. 1-8, May 2022. |
Paper # |
COMP2022-1 |
Date of Issue |
2022-05-12 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2022-1 |
Conference Information |
Committee |
COMP IPSJ-AL |
Conference Date |
2022-05-19 - 2022-05-20 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Online |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2022-05-COMP-AL |
Language |
English |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Transportation Problem on a Graph |
Sub Title (in English) |
|
Keyword(1) |
Linear programming |
Keyword(2) |
One-commodity and multi-commodity problems |
Keyword(3) |
Polynomial-time algorithm |
Keyword(4) |
Transportation problem |
Keyword(5) |
Vehicle |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Tetsuo Asano |
1st Author's Affiliation |
Kanazawa University (Kanazawa Univ.) |
2nd Author's Name |
|
2nd Author's Affiliation |
() |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2022-05-19 13:00:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2022-1 |
Volume (vol) |
vol.122 |
Number (no) |
no.33 |
Page |
pp.1-8 |
#Pages |
8 |
Date of Issue |
2022-05-12 (COMP) |