【開催概要】
・開催日：2016年7月14日(木)
・会場：大阪大学中之島センター 10Fメモリアルホール（〒530-0005大阪市北区中之島4-3-53）
・アクセス：https://www.onc.osaka-u.ac.jp/others/map/index.php

参加申込みはこちらから
・プログラム：
時間：13:30 – 15:00
講師：Prof. Pitu Mirchandani (Arizona State University)
演題：Routing, Logistics and Management of Recharging Infrastructure for Electric Vehicles
概要：There is much reason to believe that many individuals and organizations will transform their vehicles to ones that utilize alternative fuels which are more sustainable. The electric vehicle (EV) is a good candidate for this transformation, especially which “refuels” by exchanging its spent batteries with charged ones. Unfortunately, although there is much research gone into technologies of EVs, little effort have gone into designing the battery charging-/ exchanging- infrastructure. This presentation discusses the issues that must be addressed, principally the issues related to the limited driving range of each electric vehicle’s set of charged batteries and the possible detouring for battery exchanges. In particular, the talk will address the optimization and analysis of infrastructure design alternatives dealing with (1) the routing of vehicles from origins to destinations, (2) the optimum locations of battery-exchange stations, and (3) the recharging capacity and operations management of battery-exchange infrastructure. Some infrastructure design and optimization models, and some results, will be discussed in the presentation.

時間：15:30 – 17:00
講師：Prof. Stefan Voß (University of Hamburg)
演題：Matheuristics: A Tutorial with Applications in Transportation and Logistics
概要：Matheuristics are heuristic algorithms made by the interoperation of metaheuristics and mathematical programming (MP) techniques. That is, we are concerned with works that are, e.g., exploiting mathematical programming techniques in (meta)heuristic frameworks or with granting to mathematical programming approaches the cross-problem robustness and constrained CPU-time effectiveness which characterize metaheuristics. Popular matheuristics include the corridor method, POPMUSIC and generalized local branching. Common features use local search based candidate solutions by means of a fully-fledged optimization method generating optimal solutions over appropriately designed neighborhoods. That is, neighborhoods are constructed to be suitable domains for the optimization method used. We clarify differences and commonalities of these methods and exemplify by problems in transportation and logistics, and especially transportation network design and in maritime shipping.

・レセプション： 17:30 - 19:30 (無料)

・参加費
6/30まで： 会員・学生　無料， 非会員　3000円
7/1以降： 会員・学生　2000円, 非会員　5000円
・申込み方法： 詳しい情報は，氏名，所属，会員資格, レセプションへの参加の有無を記載の上，以下のメールアドレスに参加申込みをお送りください。 事前参加申込みは6月30日までとします。
・申込み先：スケジューリング学会事務局 E-mail: office@scheduling.jp
・詳細等：　詳しい情報は, CFPv1.pdfをご参照下さい．