Search Results:　 1-20 of 219

  • 1

    A Comparison between Genetic Algorithm and k-opt local search method for the Vehicle Routing Problem

    Han SangHeon

    … The Traveling Salesman problem (TSP) can be used to method many practical problems. … The Vehicle Routing Problem (VRP) is more complicated than TSP because it requires determinig which customers are assigned to each vehicles, as well as the optimal ordering of the cities within each vehcle's tour. …

    NUCB journal of economics and information science 56(1), 97-105, 2011-07

    CiNii Fulltext PDF - Open Access 

  • 2

    Examination about the CO2 Discharge Minimization in the Auto traffic  [in Japanese]

    ABE Keisuke , FUJISE Masashi , YADA Yuuya

    電気学会研究会資料. IIC, 産業計測制御研究会 2011(119), 29-33, 2011-03-08

    References (8)

  • 3

    A Heuristic Algorithm for Placement Sequence Problem with Nozzle Assignment in a Chip Mounting Machine  [in Japanese]

    Keisuke Yamamoto , Hidenori Ohta , Mario Nakamori

    … 生産効率向上を目的として,多機能型部品装着機における部品の装着順序問題の解法を論じている.この問題は装着機のライン全体の動作最適化問題の部分問題であり,配送計画問題 (Vehicle Routing Problem, VRP) の一種と解釈することができる.しかしながら,部品を装着するノズルの位置が経路に影響を及ぼすため,通常の VRP に比べてより複雑な問題となっている.本論文では装着順序問 …

    IPSJ SIG Notes 2011-MPS-82(5), 1-6, 2011-02-28

    CiNii Link1

  • 4

    Solving an asymmetric vehicle routing problem with multiple trips using minimum γ-spanning arborescence  [in Japanese]

    森山 弘海 , 水野 浩孝 , 羽田 隆男

    Journal of Japan Industrial Management Association 62(2), 31-42, 2011-06

  • 5

    Designing a multi-period vehicle routing problem for reuse systems considering consumed quantity of new package  [in Japanese]

    石原 良晃 , 平木 秀作 , 徐 祝淇 [他]

    Production management 17(3), 29-34, 2011-03

  • 6

    Disturbance recovery strategies for demand changes in vehicle routing problem with time windows

    Li Juntao , Wang Xuping , Chen Mingtian [他]

    ICIC express letters. Part B, Applications 2(2), 459-466, 2011-04

  • 7

    AN OPTIMAL ROUTING PROBLEM OF ELECTRIC VEHICLES CONSIDERING ROAD GRADIENTS

    SHIMIZU Taro , KOKUBUGATA Hisafumi , MATSUMOTO Shuichi , KAWASHIMA Hironao

    本研究では，道路勾配と電気自動車の消費電力の関係を定量化するための経路問題に関する検討を行った．電気自動車を用いた経路問題では，電気自動車の内部状態（バッテリ性能，車両重量）や回生ブレーキの利用状況などによって消費電力や走行距離が変化するので，従来の自動車の経路問題とは異なる面が多い．本研究では，道路状態を考慮した消費電力算出手法を提案し，実際に測定した標高データを用いて道路勾配等の要因が電気自動 …

    SOCIOTECHNICA 8(0), 53-59, 2011

    J-STAGE CrossRef

  • 8

    Time-Dependent Dial-a-Ride Problems: Formulation Development and Numerical Experiments

    HU Ta-Yin , CHANG Chin-Ping

    … Appropriate vehicle routes for dial-a-ride systems can increase transportation efficiency and reduce the operation cost. … Most literatures focus on improving the vehicle routing and scheduling and assume that the travel time is a constant value. … Using the constant travel time to solve dial-a-ride problems (DARP) cannot obtain the efficient vehicle routes. …

    Journal of the Eastern Asia Society for Transportation Studies 9(0), 690-701, 2011

    J-STAGE

  • 9

    A Lagrangian Heuristic for the Vehicle Routing Problems with the Private Fleet and the Common Carrier

    HUANG Kuancheng , HSU Cheng-Po

    … The delivery of goods from a warehouse to local customers is an important decision problem of a logistics operator. … In this study, we focus on the vehicle routing problem with private fleet and common carrier (VRPPC). … The VRPPC is first formulated in the form of the set covering problem, and the Lagrangian relaxation is used as the backbone in designing the iterative algorithm. …

    Journal of the Eastern Asia Society for Transportation Studies 9(0), 644-659, 2011

    J-STAGE

  • 10

    An Ant Colony Optimization Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

    CHEN Chia-Ho , TING Ching-Jung

    … The vehicle routing problem (VRP) has received a lot of attention and has been applied extensively in the field of logistics. … Hence, the heterogeneous fleet vehicle routing problem (HVRP) which minimizes the sum of fixed vehicle costs and variable routing costs is an important variant of VRP. …

    Journal of the Eastern Asia Society for Transportation Studies 9(0), 631-643, 2011

    J-STAGE

  • 11

    Mixed Integer Programming Model and Incremental Optimization for Delivery and Storage Planning Using Truck Terminals

    Sakakibara Kazutoshi , Tian Yajie , Nishikawa Ikuko

    … In this paper, we show a mixed integer programming model which represents each product explicitly, and discuss the decomposition of the problem into a problem of delivery and storage, and a problem of vehicle routing. …

    Transactions of the Institute of Systems, Control and Information Engineers 24(4), 88-96, 2011

    J-STAGE CrossRef

  • 12

    Advanced Saving Method to Evaluate Economic Concern

    Shimizu Yoshiaki

    Transactions of the Institute of Systems, Control and Information Engineers 24(2), 39-41, 2011

    J-STAGE CrossRef Cited by (1)

  • 13

    An Improved Ant Colony Algorithm for the Vehicle Routing Problem in Time-Dependent Networks

    LIU Yongqiang , CHANG Qing , XIONG Huagang

    … Vehicle routing is an important combinatorial optimization problem. … The study of vehicle routing problem in time-dependent network has even more practical value than static network VRP problem. …

    IEICE Transactions on Communications E94.B(5), 1506-1510, 2011

    J-STAGE CrossRef

  • 14

    A Model and a Method for Vehicle Routing Problem with Time Windows under Uncertainty(<Special Issue>Manufacturing Systems Division Conference 2010)  [in Japanese]

    MURAKAMI Keisuke , MORITA Hiroshi

    … This paper discusses the vehicle routing problem with time windows and stochastic demands. … The customers' demands are characterized by a known probability distribution and a customer's actual demand is only revealed when the vehicle reaches the customer location. … When the total demands of customers on a route exceed the capacity of the vehicle, extra path to depot for replenishment must occur. …

    Transactions of the Japan Society of Mechanical Engineers. C 76(772), 3220-3229, 2010-12-25

    CiNii Fulltext PDF - Open Access  References (15)

  • 15

    New Movements of Ad Hoc Networks  [in Japanese]

    Matsui Susumu

    アドホックネットワーク技術の研究は1970年代に米国国防関係で開始された.1997年にはIETF MANET WGで標準化活動が開始され,現在,標準化の一歩手前まできている.また,メッシュネットワークの標準化もIEEE802.11sで行われており,これについても,標準化が見えてきている.一方,アドホック/メッシュネットワークの実用化に向けての実証実験も行われている.主な,適用先は,イベント監視シス …

    IEICE technical report 110(254), 21-29, 2010-10-21

    CiNii Fulltext PDF - Limited 

  • 16

    New Movements of Ad Hoc Networks  [in Japanese]

    Matsui Susumu

    アドホックネットワーク技術の研究は1970年代に米国国防関係で開始された.1997年にはIETF MANET WGで標準化活動が開始され,現在,標準化の一歩手前まできている.また,メッシュネットワークの標準化もIEEE802.11sで行われており,これについても,標準化が見えてきている.一方,アドホック/メッシュネットワークの実用化に向けての実証実験も行われている.主な,適用先は,イベント監視シス …

    Technical report of IEICE. RCS 110(251), 75-83, 2010-10-20

    CiNii Fulltext PDF - Limited 

  • 17

    New Movements of Ad Hoc Networks  [in Japanese]

    Matsui Susumu

    アドホックネットワーク技術の研究は1970年代に米国国防関係で開始された.1997年にはIETF MANET WGで標準化活動が開始され,現在,標準化の一歩手前まできている.また,メッシュネットワークの標準化もIEEE802.11sで行われており,これについても,標準化が見えてきている.一方,アドホック/メッシュネットワークの実用化に向けての実証実験も行われている.主な,適用先は,イベント監視シス …

    IEICE technical report 110(252), 85-93, 2010-10-20

    CiNii Fulltext PDF - Limited 

  • 18

    Determination of Weights of Generalized Voronoi Regions Using Tabu Search and Applications(Theory and Methodology)  [in Japanese]

    ONO Tsutomu , KANAGAWA Akihiro , YAMAUCHI Hitoshi , MIYAZAKI Shigeji

    地理情報学などでよく用いられるボロノイ領域とは,平面上に複数ある母点と呼ばれる点よりユークリッド距離での影響が及ぶ近傍領域を指す.このボロノイ領域を一般化したものに重み付きボロノイ領域がある.本論文では,ある仮定のもと,この重み付きボロノイ領域の重みを算出する手順と,その応用例について述べる.その仮定とは,平面上に母点以外の子点と呼ぶ点の存在を考え,各々の母点が支配する領域が,この子点を数量的に包 …

    Journal of Japan Industrial Management Association 61(4), 253-262, 2010-10-15

    CiNii Fulltext PDF - Open Access  References (17)

  • 19

    Proposal of a Hybrid Search Method for the Bi-objective Logistics Problem of Minimizing Total Distance Traveled and Average Completion Time  [in Japanese]

    Bou Toshitaka , ARAKAWA Masahiro

    本研究では配送計画問題においてトレードオフの関係にある"全配送車の総距離"と"平均稼働時間"を目的関数として取り上げて,質の高いパレート解を短時間で探索するために個々の目的関数に対する単目的の探索法を多目的遺伝的アルゴリズムに組み込んだハイブリッド型探索法を提案する.多目的問題の異なる目的関数で優れた解を探索するための方法が異なる場合では一種類の探索方法によって得られるパレート解は偏った分布となる …

    Journal of Japan Industrial Management Association 61(4), 223-233, 2010-10-15

    CiNii Fulltext PDF - Open Access  References (17)

  • 20

    S1402-2-1 Hierarchical Optimization of Green Logistics Network Design  [in Japanese]

    TAKEMURA Takashi , TSUCHIYA Syota , SHIMIZU Yoshiaki

    … Concerning with a green logistics optimization problem under reliability consideration, we have engaged in multi-objective analysis by developing an extended method of hybrid tabu search. … It is a hierarchical method composed of tabu search and graph algorithms for solving the minimum cost flow problem. …

    年次大会講演論文集 : JSME annual meeting 2010(4), 297-298, 2010-09-04

    CiNii Fulltext PDF - Subscription